H-Termination proof of /home/matraf/haskell/eval_FullyBlown

MAYBE 8.722 H-Termination proof of /home/matraf/haskell/eval_FullyBlown_Fast/empty.hs
H-Termination of the given Haskell-Program with start terms could not be shown:

↳ HASKELL

  ↳ IFR

mainModule Main

((toRational :: Real a => a -> Ratio Integer) :: Real a => a -> Ratio Integer)

module Main where

import qualified Prelude

If Reductions:
The following If expression

if primGEqNatS x y then Succ (primDivNatS (primMinusNatS x y) (Succ y)) else Zero

is transformed to

primDivNatS0 x y True = Succ (primDivNatS (primMinusNatS x y) (Succ y))

primDivNatS0 x y False = Zero

The following If expression

if primGEqNatS x y then primModNatS (primMinusNatS x y) (Succ y) else Succ x

is transformed to

primModNatS0 x y True = primModNatS (primMinusNatS x y) (Succ y)

primModNatS0 x y False = Succ x

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

mainModule Main

((toRational :: Real a => a -> Ratio Integer) :: Real a => a -> Ratio Integer)

module Main where

import qualified Prelude

Replaced joker patterns by fresh variables and removed binding patterns.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

mainModule Main

((toRational :: Real a => a -> Ratio Integer) :: Real a => a -> Ratio Integer)

module Main where

import qualified Prelude

Cond Reductions:
The following Function with conditions

gcd' x 0 = x

gcd' x y = gcd' y (x `rem` y)

is transformed to

gcd' x xz = gcd'2 x xz

gcd' x y = gcd'0 x y

gcd'0 x y = gcd' y (x `rem` y)

gcd'1 True x xz = x

gcd'1 yu yv yw = gcd'0 yv yw

gcd'2 x xz = gcd'1 (xz == 0) x xz

gcd'2 yx yy = gcd'0 yx yy

The following Function with conditions

gcd 0 0 = error []

gcd x y =

gcd' (abs x) (abs y)

where

gcd' x 0 = x

gcd' x y = gcd' y (x `rem` y)

is transformed to

gcd yz zu = gcd3 yz zu

gcd x y = gcd0 x y

gcd0 x y =

gcd' (abs x) (abs y)

where

gcd' x xz = gcd'2 x xz

gcd' x y = gcd'0 x y

gcd'0 x y = gcd' y (x `rem` y)

gcd'1 True x xz = x

gcd'1 yu yv yw = gcd'0 yv yw

gcd'2 x xz = gcd'1 (xz == 0) x xz

gcd'2 yx yy = gcd'0 yx yy

gcd1 True yz zu = error []

gcd1 zv zw zx = gcd0 zw zx

gcd2 True yz zu = gcd1 (zu == 0) yz zu

gcd2 zy zz vuu = gcd0 zz vuu

gcd3 yz zu = gcd2 (yz == 0) yz zu

gcd3 vuv vuw = gcd0 vuv vuw

The following Function with conditions

absReal x

| x >= 0

= x

| otherwise

= `negate` x

is transformed to

absReal x = absReal2 x

absReal1 x True = x

absReal1 x False = absReal0 x otherwise

absReal0 x True = `negate` x

absReal2 x = absReal1 x (x >= 0)

The following Function with conditions

undefined

| False

= undefined

is transformed to

undefined = undefined1

undefined0 True = undefined

undefined1 = undefined0 False

The following Function with conditions

reduce x y

| y == 0

= error []

| otherwise

= x `quot` d :% (y `quot` d)

where

d = gcd x y

is transformed to

reduce x y = reduce2 x y

reduce2 x y =

reduce1 x y (y == 0)

where

d = gcd x y

reduce0 x y True = x `quot` d :% (y `quot` d)

reduce1 x y True = error []

reduce1 x y False = reduce0 x y otherwise

The following Function with conditions

signumReal x

| x == 0

= 0

| x > 0

= 1

| otherwise

= -1

is transformed to

signumReal x = signumReal3 x

signumReal2 x True = 0

signumReal2 x False = signumReal1 x (x > 0)

signumReal1 x True = 1

signumReal1 x False = signumReal0 x otherwise

signumReal0 x True = -1

signumReal3 x = signumReal2 x (x == 0)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

mainModule Main

((toRational :: Real a => a -> Ratio Integer) :: Real a => a -> Ratio Integer)

module Main where

import qualified Prelude

Let/Where Reductions:
The bindings of the following Let/Where expression

reduce1 x y (y == 0)

where

d = gcd x y

reduce0 x y True = x `quot` d :% (y `quot` d)

reduce1 x y True = error []

reduce1 x y False = reduce0 x y otherwise

are unpacked to the following functions on top level

reduce2D vux vuy = gcd vux vuy

reduce2Reduce0 vux vuy x y True = x `quot` reduce2D vux vuy :% (y `quot` reduce2D vux vuy)

reduce2Reduce1 vux vuy x y True = error []

reduce2Reduce1 vux vuy x y False = reduce2Reduce0 vux vuy x y otherwise

The bindings of the following Let/Where expression

gcd' (abs x) (abs y)

where

gcd' x xz = gcd'2 x xz

gcd' x y = gcd'0 x y

gcd'0 x y = gcd' y (x `rem` y)

gcd'1 True x xz = x

gcd'1 yu yv yw = gcd'0 yv yw

gcd'2 x xz = gcd'1 (xz == 0) x xz

gcd'2 yx yy = gcd'0 yx yy

are unpacked to the following functions on top level

gcd0Gcd'0 x y = gcd0Gcd' y (x `rem` y)

gcd0Gcd'2 x xz = gcd0Gcd'1 (xz == 0) x xz

gcd0Gcd'2 yx yy = gcd0Gcd'0 yx yy

gcd0Gcd'1 True x xz = x

gcd0Gcd'1 yu yv yw = gcd0Gcd'0 yv yw

gcd0Gcd' x xz = gcd0Gcd'2 x xz

gcd0Gcd' x y = gcd0Gcd'0 x y

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

mainModule Main

((toRational :: Real a => a -> Ratio Integer) :: Real a => a -> Ratio Integer)

module Main where

import qualified Prelude

Num Reduction: All numbers are transformed to thier corresponding representation with Pos, Neg, Succ and Zero.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                      ↳ Narrow

mainModule Main

(toRational :: Real a => a -> Ratio Integer)

module Main where

import qualified Prelude

Haskell To QDPs

digraph dp_graph {
node [outthreshold=100, inthreshold=100];1[label="toRational\n  Real a",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3];
3[label="toRational vuz3\n  Real a",fontsize=16,color="blue",shape="box"];3470[label="toRational :: Double -> Ratio Integer",fontsize=10,color="white",style="solid",shape="box"];3 -> 3470[label="",style="solid", color="blue", weight=9];
3470 -> 4[label="",style="solid", color="blue", weight=3];
3471[label="toRational :: Integer -> Ratio Integer",fontsize=10,color="white",style="solid",shape="box"];3 -> 3471[label="",style="solid", color="blue", weight=9];
3471 -> 5[label="",style="solid", color="blue", weight=3];
3472[label="toRational :: Int -> Ratio Integer",fontsize=10,color="white",style="solid",shape="box"];3 -> 3472[label="",style="solid", color="blue", weight=9];
3472 -> 6[label="",style="solid", color="blue", weight=3];
3473[label="toRational :: Float -> Ratio Integer",fontsize=10,color="white",style="solid",shape="box"];3 -> 3473[label="",style="solid", color="blue", weight=9];
3473 -> 7[label="",style="solid", color="blue", weight=3];
3474[label="toRational :: (Ratio a) -> Ratio Integer",fontsize=10,color="white",style="solid",shape="box"];3 -> 3474[label="",style="solid", color="blue", weight=9];
3474 -> 8[label="",style="solid", color="blue", weight=3];
4[label="toRational vuz3",fontsize=16,color="black",shape="box"];4 -> 9[label="",style="solid", color="black", weight=3];
5[label="toRational vuz3",fontsize=16,color="black",shape="box"];5 -> 10[label="",style="solid", color="black", weight=3];
6[label="toRational vuz3",fontsize=16,color="black",shape="box"];6 -> 11[label="",style="solid", color="black", weight=3];
7[label="toRational vuz3",fontsize=16,color="black",shape="box"];7 -> 12[label="",style="solid", color="black", weight=3];
8[label="toRational vuz3\n  Integral a",fontsize=16,color="burlywood",shape="box"];3475[label="vuz3/vuz30 :% vuz31",fontsize=10,color="white",style="solid",shape="box"];8 -> 3475[label="",style="solid", color="burlywood", weight=9];
3475 -> 13[label="",style="solid", color="burlywood", weight=3];
9[label="doubleToRational vuz3",fontsize=16,color="burlywood",shape="box"];3476[label="vuz3/Double vuz30 vuz31",fontsize=10,color="white",style="solid",shape="box"];9 -> 3476[label="",style="solid", color="burlywood", weight=9];
3476 -> 14[label="",style="solid", color="burlywood", weight=3];
10[label="vuz3 % fromInt (Pos (Succ Zero))",fontsize=16,color="black",shape="triangle"];10 -> 15[label="",style="solid", color="black", weight=3];
11 -> 10[label="",style="dashed", color="red", weight=0];
11[label="toInteger vuz3 % fromInt (Pos (Succ Zero))",fontsize=16,color="magenta"];11 -> 16[label="",style="dashed", color="magenta", weight=3];
12[label="floatToRational vuz3",fontsize=16,color="burlywood",shape="box"];3478[label="vuz3/Float vuz30 vuz31",fontsize=10,color="white",style="solid",shape="box"];12 -> 3478[label="",style="solid", color="burlywood", weight=9];
3478 -> 17[label="",style="solid", color="burlywood", weight=3];
13[label="toRational (vuz30 :% vuz31)\n  Integral a",fontsize=16,color="black",shape="box"];13 -> 18[label="",style="solid", color="black", weight=3];
14[label="doubleToRational (Double vuz30 vuz31)",fontsize=16,color="black",shape="box"];14 -> 19[label="",style="solid", color="black", weight=3];
15[label="reduce (vuz3 * signum (fromInt (Pos (Succ Zero)))) (abs (fromInt (Pos (Succ Zero))))",fontsize=16,color="black",shape="box"];15 -> 20[label="",style="solid", color="black", weight=3];
16[label="toInteger vuz3",fontsize=16,color="black",shape="triangle"];16 -> 21[label="",style="solid", color="black", weight=3];
17[label="floatToRational (Float vuz30 vuz31)",fontsize=16,color="black",shape="box"];17 -> 22[label="",style="solid", color="black", weight=3];
18[label="toInteger vuz30 :% toInteger vuz31\n  Integral a",fontsize=16,color="green",shape="box"];18 -> 23[label="",style="dashed", color="green", weight=3];
18 -> 24[label="",style="dashed", color="green", weight=3];
19[label="Integer vuz30 % Integer vuz31",fontsize=16,color="black",shape="triangle"];19 -> 25[label="",style="solid", color="black", weight=3];
20[label="reduce2 (vuz3 * signum (fromInt (Pos (Succ Zero)))) (abs (fromInt (Pos (Succ Zero))))",fontsize=16,color="black",shape="box"];20 -> 26[label="",style="solid", color="black", weight=3];
21[label="Integer vuz3",fontsize=16,color="green",shape="box"];22 -> 19[label="",style="dashed", color="red", weight=0];
22[label="Integer vuz30 % Integer vuz31",fontsize=16,color="magenta"];22 -> 27[label="",style="dashed", color="magenta", weight=3];
22 -> 28[label="",style="dashed", color="magenta", weight=3];
23[label="toInteger vuz30\n  Integral a",fontsize=16,color="blue",shape="box"];3480[label="toInteger :: Int -> Integer",fontsize=10,color="white",style="solid",shape="box"];23 -> 3480[label="",style="solid", color="blue", weight=9];
3480 -> 29[label="",style="solid", color="blue", weight=3];
3481[label="toInteger :: Integer -> Integer",fontsize=10,color="white",style="solid",shape="box"];23 -> 3481[label="",style="solid", color="blue", weight=9];
3481 -> 30[label="",style="solid", color="blue", weight=3];
24[label="toInteger vuz31\n  Integral a",fontsize=16,color="blue",shape="box"];3482[label="toInteger :: Int -> Integer",fontsize=10,color="white",style="solid",shape="box"];24 -> 3482[label="",style="solid", color="blue", weight=9];
3482 -> 31[label="",style="solid", color="blue", weight=3];
3483[label="toInteger :: Integer -> Integer",fontsize=10,color="white",style="solid",shape="box"];24 -> 3483[label="",style="solid", color="blue", weight=9];
3483 -> 32[label="",style="solid", color="blue", weight=3];
25[label="reduce (Integer vuz30 * signum (Integer vuz31)) (abs (Integer vuz31))",fontsize=16,color="black",shape="box"];25 -> 33[label="",style="solid", color="black", weight=3];
26[label="reduce2Reduce1 (vuz3 * signum (fromInt (Pos (Succ Zero)))) (abs (fromInt (Pos (Succ Zero)))) (vuz3 * signum (fromInt (Pos (Succ Zero)))) (abs (fromInt (Pos (Succ Zero)))) (abs (fromInt (Pos (Succ Zero))) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];26 -> 34[label="",style="solid", color="black", weight=3];
27[label="vuz31",fontsize=16,color="green",shape="box"];28[label="vuz30",fontsize=16,color="green",shape="box"];29 -> 16[label="",style="dashed", color="red", weight=0];
29[label="toInteger vuz30",fontsize=16,color="magenta"];29 -> 35[label="",style="dashed", color="magenta", weight=3];
30[label="toInteger vuz30",fontsize=16,color="black",shape="triangle"];30 -> 36[label="",style="solid", color="black", weight=3];
31 -> 16[label="",style="dashed", color="red", weight=0];
31[label="toInteger vuz31",fontsize=16,color="magenta"];31 -> 37[label="",style="dashed", color="magenta", weight=3];
32 -> 30[label="",style="dashed", color="red", weight=0];
32[label="toInteger vuz31",fontsize=16,color="magenta"];32 -> 38[label="",style="dashed", color="magenta", weight=3];
33[label="reduce2 (Integer vuz30 * signum (Integer vuz31)) (abs (Integer vuz31))",fontsize=16,color="black",shape="box"];33 -> 39[label="",style="solid", color="black", weight=3];
34[label="reduce2Reduce1 (vuz3 * signum (fromInt (Pos (Succ Zero)))) (absReal (fromInt (Pos (Succ Zero)))) (vuz3 * signum (fromInt (Pos (Succ Zero)))) (absReal (fromInt (Pos (Succ Zero)))) (absReal (fromInt (Pos (Succ Zero))) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];34 -> 40[label="",style="solid", color="black", weight=3];
35[label="vuz30",fontsize=16,color="green",shape="box"];36[label="vuz30",fontsize=16,color="green",shape="box"];37[label="vuz31",fontsize=16,color="green",shape="box"];38[label="vuz31",fontsize=16,color="green",shape="box"];39[label="reduce2Reduce1 (Integer vuz30 * signum (Integer vuz31)) (abs (Integer vuz31)) (Integer vuz30 * signum (Integer vuz31)) (abs (Integer vuz31)) (abs (Integer vuz31) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];39 -> 41[label="",style="solid", color="black", weight=3];
40[label="reduce2Reduce1 (vuz3 * signum (fromInt (Pos (Succ Zero)))) (absReal2 (fromInt (Pos (Succ Zero)))) (vuz3 * signum (fromInt (Pos (Succ Zero)))) (absReal2 (fromInt (Pos (Succ Zero)))) (absReal2 (fromInt (Pos (Succ Zero))) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];40 -> 42[label="",style="solid", color="black", weight=3];
41[label="reduce2Reduce1 (Integer vuz30 * signum (Integer vuz31)) (absReal (Integer vuz31)) (Integer vuz30 * signum (Integer vuz31)) (absReal (Integer vuz31)) (absReal (Integer vuz31) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];41 -> 43[label="",style="solid", color="black", weight=3];
42[label="reduce2Reduce1 (vuz3 * signum (fromInt (Pos (Succ Zero)))) (absReal1 (fromInt (Pos (Succ Zero))) (fromInt (Pos (Succ Zero)) >= fromInt (Pos Zero))) (vuz3 * signum (fromInt (Pos (Succ Zero)))) (absReal1 (fromInt (Pos (Succ Zero))) (fromInt (Pos (Succ Zero)) >= fromInt (Pos Zero))) (absReal1 (fromInt (Pos (Succ Zero))) (fromInt (Pos (Succ Zero)) >= fromInt (Pos Zero)) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];42 -> 44[label="",style="solid", color="black", weight=3];
43[label="reduce2Reduce1 (Integer vuz30 * signum (Integer vuz31)) (absReal2 (Integer vuz31)) (Integer vuz30 * signum (Integer vuz31)) (absReal2 (Integer vuz31)) (absReal2 (Integer vuz31) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];43 -> 45[label="",style="solid", color="black", weight=3];
44[label="reduce2Reduce1 (vuz3 * signum (fromInt (Pos (Succ Zero)))) (absReal1 (fromInt (Pos (Succ Zero))) (compare (fromInt (Pos (Succ Zero))) (fromInt (Pos Zero)) /= LT)) (vuz3 * signum (fromInt (Pos (Succ Zero)))) (absReal1 (fromInt (Pos (Succ Zero))) (compare (fromInt (Pos (Succ Zero))) (fromInt (Pos Zero)) /= LT)) (absReal1 (fromInt (Pos (Succ Zero))) (compare (fromInt (Pos (Succ Zero))) (fromInt (Pos Zero)) /= LT) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];44 -> 46[label="",style="solid", color="black", weight=3];
45[label="reduce2Reduce1 (Integer vuz30 * signum (Integer vuz31)) (absReal1 (Integer vuz31) (Integer vuz31 >= fromInt (Pos Zero))) (Integer vuz30 * signum (Integer vuz31)) (absReal1 (Integer vuz31) (Integer vuz31 >= fromInt (Pos Zero))) (absReal1 (Integer vuz31) (Integer vuz31 >= fromInt (Pos Zero)) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];45 -> 47[label="",style="solid", color="black", weight=3];
46[label="reduce2Reduce1 (vuz3 * signum (fromInt (Pos (Succ Zero)))) (absReal1 (fromInt (Pos (Succ Zero))) (not (compare (fromInt (Pos (Succ Zero))) (fromInt (Pos Zero)) == LT))) (vuz3 * signum (fromInt (Pos (Succ Zero)))) (absReal1 (fromInt (Pos (Succ Zero))) (not (compare (fromInt (Pos (Succ Zero))) (fromInt (Pos Zero)) == LT))) (absReal1 (fromInt (Pos (Succ Zero))) (not (compare (fromInt (Pos (Succ Zero))) (fromInt (Pos Zero)) == LT)) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];46 -> 48[label="",style="solid", color="black", weight=3];
47[label="reduce2Reduce1 (Integer vuz30 * signum (Integer vuz31)) (absReal1 (Integer vuz31) (compare (Integer vuz31) (fromInt (Pos Zero)) /= LT)) (Integer vuz30 * signum (Integer vuz31)) (absReal1 (Integer vuz31) (compare (Integer vuz31) (fromInt (Pos Zero)) /= LT)) (absReal1 (Integer vuz31) (compare (Integer vuz31) (fromInt (Pos Zero)) /= LT) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];47 -> 49[label="",style="solid", color="black", weight=3];
48[label="reduce2Reduce1 (vuz3 * signum (Integer (Pos (Succ Zero)))) (absReal1 (Integer (Pos (Succ Zero))) (not (compare (Integer (Pos (Succ Zero))) (fromInt (Pos Zero)) == LT))) (vuz3 * signum (Integer (Pos (Succ Zero)))) (absReal1 (Integer (Pos (Succ Zero))) (not (compare (Integer (Pos (Succ Zero))) (fromInt (Pos Zero)) == LT))) (absReal1 (Integer (Pos (Succ Zero))) (not (compare (Integer (Pos (Succ Zero))) (fromInt (Pos Zero)) == LT)) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];48 -> 50[label="",style="solid", color="black", weight=3];
49[label="reduce2Reduce1 (Integer vuz30 * signum (Integer vuz31)) (absReal1 (Integer vuz31) (not (compare (Integer vuz31) (fromInt (Pos Zero)) == LT))) (Integer vuz30 * signum (Integer vuz31)) (absReal1 (Integer vuz31) (not (compare (Integer vuz31) (fromInt (Pos Zero)) == LT))) (absReal1 (Integer vuz31) (not (compare (Integer vuz31) (fromInt (Pos Zero)) == LT)) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];49 -> 51[label="",style="solid", color="black", weight=3];
50[label="reduce2Reduce1 (vuz3 * signum (Integer (Pos (Succ Zero)))) (absReal1 (Integer (Pos (Succ Zero))) (not (compare (Integer (Pos (Succ Zero))) (Integer (Pos Zero)) == LT))) (vuz3 * signum (Integer (Pos (Succ Zero)))) (absReal1 (Integer (Pos (Succ Zero))) (not (compare (Integer (Pos (Succ Zero))) (Integer (Pos Zero)) == LT))) (absReal1 (Integer (Pos (Succ Zero))) (not (compare (Integer (Pos (Succ Zero))) (Integer (Pos Zero)) == LT)) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];50 -> 52[label="",style="solid", color="black", weight=3];
51[label="reduce2Reduce1 (Integer vuz30 * signum (Integer vuz31)) (absReal1 (Integer vuz31) (not (compare (Integer vuz31) (Integer (Pos Zero)) == LT))) (Integer vuz30 * signum (Integer vuz31)) (absReal1 (Integer vuz31) (not (compare (Integer vuz31) (Integer (Pos Zero)) == LT))) (absReal1 (Integer vuz31) (not (compare (Integer vuz31) (Integer (Pos Zero)) == LT)) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];51 -> 53[label="",style="solid", color="black", weight=3];
52[label="reduce2Reduce1 (vuz3 * signum (Integer (Pos (Succ Zero)))) (absReal1 (Integer (Pos (Succ Zero))) (not (primCmpInt (Pos (Succ Zero)) (Pos Zero) == LT))) (vuz3 * signum (Integer (Pos (Succ Zero)))) (absReal1 (Integer (Pos (Succ Zero))) (not (primCmpInt (Pos (Succ Zero)) (Pos Zero) == LT))) (absReal1 (Integer (Pos (Succ Zero))) (not (primCmpInt (Pos (Succ Zero)) (Pos Zero) == LT)) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];52 -> 54[label="",style="solid", color="black", weight=3];
53[label="reduce2Reduce1 (Integer vuz30 * signum (Integer vuz31)) (absReal1 (Integer vuz31) (not (primCmpInt vuz31 (Pos Zero) == LT))) (Integer vuz30 * signum (Integer vuz31)) (absReal1 (Integer vuz31) (not (primCmpInt vuz31 (Pos Zero) == LT))) (absReal1 (Integer vuz31) (not (primCmpInt vuz31 (Pos Zero) == LT)) == fromInt (Pos Zero))",fontsize=16,color="burlywood",shape="box"];3487[label="vuz31/Pos vuz310",fontsize=10,color="white",style="solid",shape="box"];53 -> 3487[label="",style="solid", color="burlywood", weight=9];
3487 -> 55[label="",style="solid", color="burlywood", weight=3];
3488[label="vuz31/Neg vuz310",fontsize=10,color="white",style="solid",shape="box"];53 -> 3488[label="",style="solid", color="burlywood", weight=9];
3488 -> 56[label="",style="solid", color="burlywood", weight=3];
54[label="reduce2Reduce1 (vuz3 * signum (Integer (Pos (Succ Zero)))) (absReal1 (Integer (Pos (Succ Zero))) (not (primCmpNat (Succ Zero) Zero == LT))) (vuz3 * signum (Integer (Pos (Succ Zero)))) (absReal1 (Integer (Pos (Succ Zero))) (not (primCmpNat (Succ Zero) Zero == LT))) (absReal1 (Integer (Pos (Succ Zero))) (not (primCmpNat (Succ Zero) Zero == LT)) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];54 -> 57[label="",style="solid", color="black", weight=3];
55[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Pos vuz310))) (absReal1 (Integer (Pos vuz310)) (not (primCmpInt (Pos vuz310) (Pos Zero) == LT))) (Integer vuz30 * signum (Integer (Pos vuz310))) (absReal1 (Integer (Pos vuz310)) (not (primCmpInt (Pos vuz310) (Pos Zero) == LT))) (absReal1 (Integer (Pos vuz310)) (not (primCmpInt (Pos vuz310) (Pos Zero) == LT)) == fromInt (Pos Zero))",fontsize=16,color="burlywood",shape="box"];3489[label="vuz310/Succ vuz3100",fontsize=10,color="white",style="solid",shape="box"];55 -> 3489[label="",style="solid", color="burlywood", weight=9];
3489 -> 58[label="",style="solid", color="burlywood", weight=3];
3490[label="vuz310/Zero",fontsize=10,color="white",style="solid",shape="box"];55 -> 3490[label="",style="solid", color="burlywood", weight=9];
3490 -> 59[label="",style="solid", color="burlywood", weight=3];
56[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg vuz310))) (absReal1 (Integer (Neg vuz310)) (not (primCmpInt (Neg vuz310) (Pos Zero) == LT))) (Integer vuz30 * signum (Integer (Neg vuz310))) (absReal1 (Integer (Neg vuz310)) (not (primCmpInt (Neg vuz310) (Pos Zero) == LT))) (absReal1 (Integer (Neg vuz310)) (not (primCmpInt (Neg vuz310) (Pos Zero) == LT)) == fromInt (Pos Zero))",fontsize=16,color="burlywood",shape="box"];3491[label="vuz310/Succ vuz3100",fontsize=10,color="white",style="solid",shape="box"];56 -> 3491[label="",style="solid", color="burlywood", weight=9];
3491 -> 60[label="",style="solid", color="burlywood", weight=3];
3492[label="vuz310/Zero",fontsize=10,color="white",style="solid",shape="box"];56 -> 3492[label="",style="solid", color="burlywood", weight=9];
3492 -> 61[label="",style="solid", color="burlywood", weight=3];
57[label="reduce2Reduce1 (vuz3 * signum (Integer (Pos (Succ Zero)))) (absReal1 (Integer (Pos (Succ Zero))) (not (GT == LT))) (vuz3 * signum (Integer (Pos (Succ Zero)))) (absReal1 (Integer (Pos (Succ Zero))) (not (GT == LT))) (absReal1 (Integer (Pos (Succ Zero))) (not (GT == LT)) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];57 -> 62[label="",style="solid", color="black", weight=3];
58[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (primCmpInt (Pos (Succ vuz3100)) (Pos Zero) == LT))) (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (primCmpInt (Pos (Succ vuz3100)) (Pos Zero) == LT))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (primCmpInt (Pos (Succ vuz3100)) (Pos Zero) == LT)) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];58 -> 63[label="",style="solid", color="black", weight=3];
59[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Pos Zero))) (absReal1 (Integer (Pos Zero)) (not (primCmpInt (Pos Zero) (Pos Zero) == LT))) (Integer vuz30 * signum (Integer (Pos Zero))) (absReal1 (Integer (Pos Zero)) (not (primCmpInt (Pos Zero) (Pos Zero) == LT))) (absReal1 (Integer (Pos Zero)) (not (primCmpInt (Pos Zero) (Pos Zero) == LT)) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];59 -> 64[label="",style="solid", color="black", weight=3];
60[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (absReal1 (Integer (Neg (Succ vuz3100))) (not (primCmpInt (Neg (Succ vuz3100)) (Pos Zero) == LT))) (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (absReal1 (Integer (Neg (Succ vuz3100))) (not (primCmpInt (Neg (Succ vuz3100)) (Pos Zero) == LT))) (absReal1 (Integer (Neg (Succ vuz3100))) (not (primCmpInt (Neg (Succ vuz3100)) (Pos Zero) == LT)) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];60 -> 65[label="",style="solid", color="black", weight=3];
61[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg Zero))) (absReal1 (Integer (Neg Zero)) (not (primCmpInt (Neg Zero) (Pos Zero) == LT))) (Integer vuz30 * signum (Integer (Neg Zero))) (absReal1 (Integer (Neg Zero)) (not (primCmpInt (Neg Zero) (Pos Zero) == LT))) (absReal1 (Integer (Neg Zero)) (not (primCmpInt (Neg Zero) (Pos Zero) == LT)) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];61 -> 66[label="",style="solid", color="black", weight=3];
62[label="reduce2Reduce1 (vuz3 * signum (Integer (Pos (Succ Zero)))) (absReal1 (Integer (Pos (Succ Zero))) (not False)) (vuz3 * signum (Integer (Pos (Succ Zero)))) (absReal1 (Integer (Pos (Succ Zero))) (not False)) (absReal1 (Integer (Pos (Succ Zero))) (not False) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];62 -> 67[label="",style="solid", color="black", weight=3];
63[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (primCmpNat (Succ vuz3100) Zero == LT))) (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (primCmpNat (Succ vuz3100) Zero == LT))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (primCmpNat (Succ vuz3100) Zero == LT)) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];63 -> 68[label="",style="solid", color="black", weight=3];
64[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Pos Zero))) (absReal1 (Integer (Pos Zero)) (not (EQ == LT))) (Integer vuz30 * signum (Integer (Pos Zero))) (absReal1 (Integer (Pos Zero)) (not (EQ == LT))) (absReal1 (Integer (Pos Zero)) (not (EQ == LT)) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];64 -> 69[label="",style="solid", color="black", weight=3];
65[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (absReal1 (Integer (Neg (Succ vuz3100))) (not (LT == LT))) (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (absReal1 (Integer (Neg (Succ vuz3100))) (not (LT == LT))) (absReal1 (Integer (Neg (Succ vuz3100))) (not (LT == LT)) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];65 -> 70[label="",style="solid", color="black", weight=3];
66[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg Zero))) (absReal1 (Integer (Neg Zero)) (not (EQ == LT))) (Integer vuz30 * signum (Integer (Neg Zero))) (absReal1 (Integer (Neg Zero)) (not (EQ == LT))) (absReal1 (Integer (Neg Zero)) (not (EQ == LT)) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];66 -> 71[label="",style="solid", color="black", weight=3];
67[label="reduce2Reduce1 (vuz3 * signum (Integer (Pos (Succ Zero)))) (absReal1 (Integer (Pos (Succ Zero))) True) (vuz3 * signum (Integer (Pos (Succ Zero)))) (absReal1 (Integer (Pos (Succ Zero))) True) (absReal1 (Integer (Pos (Succ Zero))) True == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];67 -> 72[label="",style="solid", color="black", weight=3];
68[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (GT == LT))) (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (GT == LT))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (GT == LT)) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];68 -> 73[label="",style="solid", color="black", weight=3];
69[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Pos Zero))) (absReal1 (Integer (Pos Zero)) (not False)) (Integer vuz30 * signum (Integer (Pos Zero))) (absReal1 (Integer (Pos Zero)) (not False)) (absReal1 (Integer (Pos Zero)) (not False) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];69 -> 74[label="",style="solid", color="black", weight=3];
70[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (absReal1 (Integer (Neg (Succ vuz3100))) (not True)) (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (absReal1 (Integer (Neg (Succ vuz3100))) (not True)) (absReal1 (Integer (Neg (Succ vuz3100))) (not True) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];70 -> 75[label="",style="solid", color="black", weight=3];
71[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg Zero))) (absReal1 (Integer (Neg Zero)) (not False)) (Integer vuz30 * signum (Integer (Neg Zero))) (absReal1 (Integer (Neg Zero)) (not False)) (absReal1 (Integer (Neg Zero)) (not False) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];71 -> 76[label="",style="solid", color="black", weight=3];
72[label="reduce2Reduce1 (vuz3 * signum (Integer (Pos (Succ Zero)))) (Integer (Pos (Succ Zero))) (vuz3 * signum (Integer (Pos (Succ Zero)))) (Integer (Pos (Succ Zero))) (Integer (Pos (Succ Zero)) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];72 -> 77[label="",style="solid", color="black", weight=3];
73[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (absReal1 (Integer (Pos (Succ vuz3100))) (not False)) (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (absReal1 (Integer (Pos (Succ vuz3100))) (not False)) (absReal1 (Integer (Pos (Succ vuz3100))) (not False) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];73 -> 78[label="",style="solid", color="black", weight=3];
74[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Pos Zero))) (absReal1 (Integer (Pos Zero)) True) (Integer vuz30 * signum (Integer (Pos Zero))) (absReal1 (Integer (Pos Zero)) True) (absReal1 (Integer (Pos Zero)) True == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];74 -> 79[label="",style="solid", color="black", weight=3];
75[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (absReal1 (Integer (Neg (Succ vuz3100))) False) (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (absReal1 (Integer (Neg (Succ vuz3100))) False) (absReal1 (Integer (Neg (Succ vuz3100))) False == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];75 -> 80[label="",style="solid", color="black", weight=3];
76[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg Zero))) (absReal1 (Integer (Neg Zero)) True) (Integer vuz30 * signum (Integer (Neg Zero))) (absReal1 (Integer (Neg Zero)) True) (absReal1 (Integer (Neg Zero)) True == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];76 -> 81[label="",style="solid", color="black", weight=3];
77[label="reduce2Reduce1 (vuz3 * signum (Integer (Pos (Succ Zero)))) (Integer (Pos (Succ Zero))) (vuz3 * signum (Integer (Pos (Succ Zero)))) (Integer (Pos (Succ Zero))) (Integer (Pos (Succ Zero)) == Integer (Pos Zero))",fontsize=16,color="black",shape="box"];77 -> 82[label="",style="solid", color="black", weight=3];
78[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (absReal1 (Integer (Pos (Succ vuz3100))) True) (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (absReal1 (Integer (Pos (Succ vuz3100))) True) (absReal1 (Integer (Pos (Succ vuz3100))) True == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];78 -> 83[label="",style="solid", color="black", weight=3];
79[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Pos Zero))) (Integer (Pos Zero)) (Integer vuz30 * signum (Integer (Pos Zero))) (Integer (Pos Zero)) (Integer (Pos Zero) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];79 -> 84[label="",style="solid", color="black", weight=3];
80[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (absReal0 (Integer (Neg (Succ vuz3100))) otherwise) (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (absReal0 (Integer (Neg (Succ vuz3100))) otherwise) (absReal0 (Integer (Neg (Succ vuz3100))) otherwise == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];80 -> 85[label="",style="solid", color="black", weight=3];
81[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg Zero))) (Integer (Neg Zero)) (Integer vuz30 * signum (Integer (Neg Zero))) (Integer (Neg Zero)) (Integer (Neg Zero) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];81 -> 86[label="",style="solid", color="black", weight=3];
82[label="reduce2Reduce1 (vuz3 * signum (Integer (Pos (Succ Zero)))) (Integer (Pos (Succ Zero))) (vuz3 * signum (Integer (Pos (Succ Zero)))) (Integer (Pos (Succ Zero))) (primEqInt (Pos (Succ Zero)) (Pos Zero))",fontsize=16,color="black",shape="box"];82 -> 87[label="",style="solid", color="black", weight=3];
83[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];83 -> 88[label="",style="solid", color="black", weight=3];
84[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Pos Zero))) (Integer (Pos Zero)) (Integer vuz30 * signum (Integer (Pos Zero))) (Integer (Pos Zero)) (Integer (Pos Zero) == Integer (Pos Zero))",fontsize=16,color="black",shape="box"];84 -> 89[label="",style="solid", color="black", weight=3];
85[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (absReal0 (Integer (Neg (Succ vuz3100))) True) (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (absReal0 (Integer (Neg (Succ vuz3100))) True) (absReal0 (Integer (Neg (Succ vuz3100))) True == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];85 -> 90[label="",style="solid", color="black", weight=3];
86[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg Zero))) (Integer (Neg Zero)) (Integer vuz30 * signum (Integer (Neg Zero))) (Integer (Neg Zero)) (Integer (Neg Zero) == Integer (Pos Zero))",fontsize=16,color="black",shape="box"];86 -> 91[label="",style="solid", color="black", weight=3];
87[label="reduce2Reduce1 (vuz3 * signum (Integer (Pos (Succ Zero)))) (Integer (Pos (Succ Zero))) (vuz3 * signum (Integer (Pos (Succ Zero)))) (Integer (Pos (Succ Zero))) False",fontsize=16,color="black",shape="box"];87 -> 92[label="",style="solid", color="black", weight=3];
88[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) == Integer (Pos Zero))",fontsize=16,color="black",shape="box"];88 -> 93[label="",style="solid", color="black", weight=3];
89[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Pos Zero))) (Integer (Pos Zero)) (Integer vuz30 * signum (Integer (Pos Zero))) (Integer (Pos Zero)) (primEqInt (Pos Zero) (Pos Zero))",fontsize=16,color="black",shape="box"];89 -> 94[label="",style="solid", color="black", weight=3];
90[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (`negate` Integer (Neg (Succ vuz3100))) (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (`negate` Integer (Neg (Succ vuz3100))) (`negate` Integer (Neg (Succ vuz3100)) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];90 -> 95[label="",style="solid", color="black", weight=3];
91[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg Zero))) (Integer (Neg Zero)) (Integer vuz30 * signum (Integer (Neg Zero))) (Integer (Neg Zero)) (primEqInt (Neg Zero) (Pos Zero))",fontsize=16,color="black",shape="box"];91 -> 96[label="",style="solid", color="black", weight=3];
92[label="reduce2Reduce0 (vuz3 * signum (Integer (Pos (Succ Zero)))) (Integer (Pos (Succ Zero))) (vuz3 * signum (Integer (Pos (Succ Zero)))) (Integer (Pos (Succ Zero))) otherwise",fontsize=16,color="black",shape="box"];92 -> 97[label="",style="solid", color="black", weight=3];
93[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) (primEqInt (Pos (Succ vuz3100)) (Pos Zero))",fontsize=16,color="black",shape="box"];93 -> 98[label="",style="solid", color="black", weight=3];
94[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Pos Zero))) (Integer (Pos Zero)) (Integer vuz30 * signum (Integer (Pos Zero))) (Integer (Pos Zero)) True",fontsize=16,color="black",shape="box"];94 -> 99[label="",style="solid", color="black", weight=3];
95[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (primNegInt (Neg (Succ vuz3100)))) (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (primNegInt (Neg (Succ vuz3100)))) (Integer (primNegInt (Neg (Succ vuz3100))) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];95 -> 100[label="",style="solid", color="black", weight=3];
96[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg Zero))) (Integer (Neg Zero)) (Integer vuz30 * signum (Integer (Neg Zero))) (Integer (Neg Zero)) True",fontsize=16,color="black",shape="box"];96 -> 101[label="",style="solid", color="black", weight=3];
97[label="reduce2Reduce0 (vuz3 * signum (Integer (Pos (Succ Zero)))) (Integer (Pos (Succ Zero))) (vuz3 * signum (Integer (Pos (Succ Zero)))) (Integer (Pos (Succ Zero))) True",fontsize=16,color="black",shape="box"];97 -> 102[label="",style="solid", color="black", weight=3];
98[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) False",fontsize=16,color="black",shape="box"];98 -> 103[label="",style="solid", color="black", weight=3];
99[label="error []",fontsize=16,color="black",shape="triangle"];99 -> 104[label="",style="solid", color="black", weight=3];
100[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (primNegInt (Neg (Succ vuz3100)))) (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (primNegInt (Neg (Succ vuz3100)))) (Integer (primNegInt (Neg (Succ vuz3100))) == Integer (Pos Zero))",fontsize=16,color="black",shape="box"];100 -> 105[label="",style="solid", color="black", weight=3];
101 -> 99[label="",style="dashed", color="red", weight=0];
101[label="error []",fontsize=16,color="magenta"];102[label="vuz3 * signum (Integer (Pos (Succ Zero))) `quot` reduce2D (vuz3 * signum (Integer (Pos (Succ Zero)))) (Integer (Pos (Succ Zero))) :% (Integer (Pos (Succ Zero)) `quot` reduce2D (vuz3 * signum (Integer (Pos (Succ Zero)))) (Integer (Pos (Succ Zero))))",fontsize=16,color="green",shape="box"];102 -> 106[label="",style="dashed", color="green", weight=3];
102 -> 107[label="",style="dashed", color="green", weight=3];
103[label="reduce2Reduce0 (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) otherwise",fontsize=16,color="black",shape="box"];103 -> 108[label="",style="solid", color="black", weight=3];
104[label="error []",fontsize=16,color="red",shape="box"];105[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (primNegInt (Neg (Succ vuz3100)))) (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (primNegInt (Neg (Succ vuz3100)))) (primEqInt (primNegInt (Neg (Succ vuz3100))) (Pos Zero))",fontsize=16,color="black",shape="box"];105 -> 109[label="",style="solid", color="black", weight=3];
106[label="vuz3 * signum (Integer (Pos (Succ Zero))) `quot` reduce2D (vuz3 * signum (Integer (Pos (Succ Zero)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="burlywood",shape="box"];3494[label="vuz3/Integer vuz30",fontsize=10,color="white",style="solid",shape="box"];106 -> 3494[label="",style="solid", color="burlywood", weight=9];
3494 -> 110[label="",style="solid", color="burlywood", weight=3];
107[label="Integer (Pos (Succ Zero)) `quot` reduce2D (vuz3 * signum (Integer (Pos (Succ Zero)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];107 -> 111[label="",style="solid", color="black", weight=3];
108[label="reduce2Reduce0 (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) True",fontsize=16,color="black",shape="box"];108 -> 112[label="",style="solid", color="black", weight=3];
109[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) (primEqInt (Pos (Succ vuz3100)) (Pos Zero))",fontsize=16,color="black",shape="box"];109 -> 113[label="",style="solid", color="black", weight=3];
110[label="Integer vuz30 * signum (Integer (Pos (Succ Zero))) `quot` reduce2D (Integer vuz30 * signum (Integer (Pos (Succ Zero)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];110 -> 114[label="",style="solid", color="black", weight=3];
111[label="Integer (Pos (Succ Zero)) `quot` gcd (vuz3 * signum (Integer (Pos (Succ Zero)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];111 -> 115[label="",style="solid", color="black", weight=3];
112[label="Integer vuz30 * signum (Integer (Pos (Succ vuz3100))) `quot` reduce2D (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) :% (Integer (Pos (Succ vuz3100)) `quot` reduce2D (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))))",fontsize=16,color="green",shape="box"];112 -> 116[label="",style="dashed", color="green", weight=3];
112 -> 117[label="",style="dashed", color="green", weight=3];
113[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) False",fontsize=16,color="black",shape="box"];113 -> 118[label="",style="solid", color="black", weight=3];
114[label="Integer vuz30 * signumReal (Integer (Pos (Succ Zero))) `quot` reduce2D (Integer vuz30 * signumReal (Integer (Pos (Succ Zero)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];114 -> 119[label="",style="solid", color="black", weight=3];
115[label="Integer (Pos (Succ Zero)) `quot` gcd3 (vuz3 * signum (Integer (Pos (Succ Zero)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];115 -> 120[label="",style="solid", color="black", weight=3];
116[label="Integer vuz30 * signum (Integer (Pos (Succ vuz3100))) `quot` reduce2D (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];116 -> 121[label="",style="solid", color="black", weight=3];
117[label="Integer (Pos (Succ vuz3100)) `quot` reduce2D (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];117 -> 122[label="",style="solid", color="black", weight=3];
118[label="reduce2Reduce0 (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) otherwise",fontsize=16,color="black",shape="box"];118 -> 123[label="",style="solid", color="black", weight=3];
119[label="Integer vuz30 * signumReal3 (Integer (Pos (Succ Zero))) `quot` reduce2D (Integer vuz30 * signumReal3 (Integer (Pos (Succ Zero)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];119 -> 124[label="",style="solid", color="black", weight=3];
120[label="Integer (Pos (Succ Zero)) `quot` gcd2 (vuz3 * signum (Integer (Pos (Succ Zero))) == fromInt (Pos Zero)) (vuz3 * signum (Integer (Pos (Succ Zero)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="burlywood",shape="box"];3495[label="vuz3/Integer vuz30",fontsize=10,color="white",style="solid",shape="box"];120 -> 3495[label="",style="solid", color="burlywood", weight=9];
3495 -> 125[label="",style="solid", color="burlywood", weight=3];
121[label="Integer vuz30 * signumReal (Integer (Pos (Succ vuz3100))) `quot` reduce2D (Integer vuz30 * signumReal (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];121 -> 126[label="",style="solid", color="black", weight=3];
122[label="Integer (Pos (Succ vuz3100)) `quot` gcd (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];122 -> 127[label="",style="solid", color="black", weight=3];
123[label="reduce2Reduce0 (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) True",fontsize=16,color="black",shape="box"];123 -> 128[label="",style="solid", color="black", weight=3];
124[label="Integer vuz30 * signumReal2 (Integer (Pos (Succ Zero))) (Integer (Pos (Succ Zero)) == fromInt (Pos Zero)) `quot` reduce2D (Integer vuz30 * signumReal2 (Integer (Pos (Succ Zero))) (Integer (Pos (Succ Zero)) == fromInt (Pos Zero))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];124 -> 129[label="",style="solid", color="black", weight=3];
125[label="Integer (Pos (Succ Zero)) `quot` gcd2 (Integer vuz30 * signum (Integer (Pos (Succ Zero))) == fromInt (Pos Zero)) (Integer vuz30 * signum (Integer (Pos (Succ Zero)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];125 -> 130[label="",style="solid", color="black", weight=3];
126[label="Integer vuz30 * signumReal3 (Integer (Pos (Succ vuz3100))) `quot` reduce2D (Integer vuz30 * signumReal3 (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];126 -> 131[label="",style="solid", color="black", weight=3];
127[label="Integer (Pos (Succ vuz3100)) `quot` gcd3 (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];127 -> 132[label="",style="solid", color="black", weight=3];
128[label="Integer vuz30 * signum (Integer (Neg (Succ vuz3100))) `quot` reduce2D (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) :% (Integer (Pos (Succ vuz3100)) `quot` reduce2D (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))))",fontsize=16,color="green",shape="box"];128 -> 133[label="",style="dashed", color="green", weight=3];
128 -> 134[label="",style="dashed", color="green", weight=3];
129[label="Integer vuz30 * signumReal2 (Integer (Pos (Succ Zero))) (Integer (Pos (Succ Zero)) == Integer (Pos Zero)) `quot` reduce2D (Integer vuz30 * signumReal2 (Integer (Pos (Succ Zero))) (Integer (Pos (Succ Zero)) == Integer (Pos Zero))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];129 -> 135[label="",style="solid", color="black", weight=3];
130[label="Integer (Pos (Succ Zero)) `quot` gcd2 (Integer vuz30 * signumReal (Integer (Pos (Succ Zero))) == fromInt (Pos Zero)) (Integer vuz30 * signumReal (Integer (Pos (Succ Zero)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];130 -> 136[label="",style="solid", color="black", weight=3];
131[label="Integer vuz30 * signumReal2 (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) `quot` reduce2D (Integer vuz30 * signumReal2 (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];131 -> 137[label="",style="solid", color="black", weight=3];
132[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signum (Integer (Pos (Succ vuz3100))) == fromInt (Pos Zero)) (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];132 -> 138[label="",style="solid", color="black", weight=3];
133[label="Integer vuz30 * signum (Integer (Neg (Succ vuz3100))) `quot` reduce2D (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];133 -> 139[label="",style="solid", color="black", weight=3];
134[label="Integer (Pos (Succ vuz3100)) `quot` reduce2D (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];134 -> 140[label="",style="solid", color="black", weight=3];
135[label="Integer vuz30 * signumReal2 (Integer (Pos (Succ Zero))) (primEqInt (Pos (Succ Zero)) (Pos Zero)) `quot` reduce2D (Integer vuz30 * signumReal2 (Integer (Pos (Succ Zero))) (primEqInt (Pos (Succ Zero)) (Pos Zero))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];135 -> 141[label="",style="solid", color="black", weight=3];
136[label="Integer (Pos (Succ Zero)) `quot` gcd2 (Integer vuz30 * signumReal3 (Integer (Pos (Succ Zero))) == fromInt (Pos Zero)) (Integer vuz30 * signumReal3 (Integer (Pos (Succ Zero)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];136 -> 142[label="",style="solid", color="black", weight=3];
137[label="Integer vuz30 * signumReal2 (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) == Integer (Pos Zero)) `quot` reduce2D (Integer vuz30 * signumReal2 (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) == Integer (Pos Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];137 -> 143[label="",style="solid", color="black", weight=3];
138[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal (Integer (Pos (Succ vuz3100))) == fromInt (Pos Zero)) (Integer vuz30 * signumReal (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];138 -> 144[label="",style="solid", color="black", weight=3];
139[label="Integer vuz30 * signumReal (Integer (Neg (Succ vuz3100))) `quot` reduce2D (Integer vuz30 * signumReal (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];139 -> 145[label="",style="solid", color="black", weight=3];
140[label="Integer (Pos (Succ vuz3100)) `quot` gcd (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];140 -> 146[label="",style="solid", color="black", weight=3];
141[label="Integer vuz30 * signumReal2 (Integer (Pos (Succ Zero))) False `quot` reduce2D (Integer vuz30 * signumReal2 (Integer (Pos (Succ Zero))) False) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];141 -> 147[label="",style="solid", color="black", weight=3];
142[label="Integer (Pos (Succ Zero)) `quot` gcd2 (Integer vuz30 * signumReal2 (Integer (Pos (Succ Zero))) (Integer (Pos (Succ Zero)) == fromInt (Pos Zero)) == fromInt (Pos Zero)) (Integer vuz30 * signumReal2 (Integer (Pos (Succ Zero))) (Integer (Pos (Succ Zero)) == fromInt (Pos Zero))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];142 -> 148[label="",style="solid", color="black", weight=3];
143[label="Integer vuz30 * signumReal2 (Integer (Pos (Succ vuz3100))) (primEqInt (Pos (Succ vuz3100)) (Pos Zero)) `quot` reduce2D (Integer vuz30 * signumReal2 (Integer (Pos (Succ vuz3100))) (primEqInt (Pos (Succ vuz3100)) (Pos Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];143 -> 149[label="",style="solid", color="black", weight=3];
144[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal3 (Integer (Pos (Succ vuz3100))) == fromInt (Pos Zero)) (Integer vuz30 * signumReal3 (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];144 -> 150[label="",style="solid", color="black", weight=3];
145[label="Integer vuz30 * signumReal3 (Integer (Neg (Succ vuz3100))) `quot` reduce2D (Integer vuz30 * signumReal3 (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];145 -> 151[label="",style="solid", color="black", weight=3];
146[label="Integer (Pos (Succ vuz3100)) `quot` gcd3 (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];146 -> 152[label="",style="solid", color="black", weight=3];
147[label="Integer vuz30 * signumReal1 (Integer (Pos (Succ Zero))) (Integer (Pos (Succ Zero)) > fromInt (Pos Zero)) `quot` reduce2D (Integer vuz30 * signumReal1 (Integer (Pos (Succ Zero))) (Integer (Pos (Succ Zero)) > fromInt (Pos Zero))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];147 -> 153[label="",style="solid", color="black", weight=3];
148[label="Integer (Pos (Succ Zero)) `quot` gcd2 (Integer vuz30 * signumReal2 (Integer (Pos (Succ Zero))) (Integer (Pos (Succ Zero)) == Integer (Pos Zero)) == fromInt (Pos Zero)) (Integer vuz30 * signumReal2 (Integer (Pos (Succ Zero))) (Integer (Pos (Succ Zero)) == Integer (Pos Zero))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];148 -> 154[label="",style="solid", color="black", weight=3];
149[label="Integer vuz30 * signumReal2 (Integer (Pos (Succ vuz3100))) False `quot` reduce2D (Integer vuz30 * signumReal2 (Integer (Pos (Succ vuz3100))) False) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];149 -> 155[label="",style="solid", color="black", weight=3];
150[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal2 (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) == fromInt (Pos Zero)) (Integer vuz30 * signumReal2 (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];150 -> 156[label="",style="solid", color="black", weight=3];
151[label="Integer vuz30 * signumReal2 (Integer (Neg (Succ vuz3100))) (Integer (Neg (Succ vuz3100)) == fromInt (Pos Zero)) `quot` reduce2D (Integer vuz30 * signumReal2 (Integer (Neg (Succ vuz3100))) (Integer (Neg (Succ vuz3100)) == fromInt (Pos Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];151 -> 157[label="",style="solid", color="black", weight=3];
152[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signum (Integer (Neg (Succ vuz3100))) == fromInt (Pos Zero)) (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];152 -> 158[label="",style="solid", color="black", weight=3];
153[label="Integer vuz30 * signumReal1 (Integer (Pos (Succ Zero))) (compare (Integer (Pos (Succ Zero))) (fromInt (Pos Zero)) == GT) `quot` reduce2D (Integer vuz30 * signumReal1 (Integer (Pos (Succ Zero))) (compare (Integer (Pos (Succ Zero))) (fromInt (Pos Zero)) == GT)) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];153 -> 159[label="",style="solid", color="black", weight=3];
154[label="Integer (Pos (Succ Zero)) `quot` gcd2 (Integer vuz30 * signumReal2 (Integer (Pos (Succ Zero))) (primEqInt (Pos (Succ Zero)) (Pos Zero)) == fromInt (Pos Zero)) (Integer vuz30 * signumReal2 (Integer (Pos (Succ Zero))) (primEqInt (Pos (Succ Zero)) (Pos Zero))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];154 -> 160[label="",style="solid", color="black", weight=3];
155[label="Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) > fromInt (Pos Zero)) `quot` reduce2D (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) > fromInt (Pos Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];155 -> 161[label="",style="solid", color="black", weight=3];
156[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal2 (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) == Integer (Pos Zero)) == fromInt (Pos Zero)) (Integer vuz30 * signumReal2 (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) == Integer (Pos Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];156 -> 162[label="",style="solid", color="black", weight=3];
157[label="Integer vuz30 * signumReal2 (Integer (Neg (Succ vuz3100))) (Integer (Neg (Succ vuz3100)) == Integer (Pos Zero)) `quot` reduce2D (Integer vuz30 * signumReal2 (Integer (Neg (Succ vuz3100))) (Integer (Neg (Succ vuz3100)) == Integer (Pos Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];157 -> 163[label="",style="solid", color="black", weight=3];
158[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal (Integer (Neg (Succ vuz3100))) == fromInt (Pos Zero)) (Integer vuz30 * signumReal (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];158 -> 164[label="",style="solid", color="black", weight=3];
159[label="Integer vuz30 * signumReal1 (Integer (Pos (Succ Zero))) (compare (Integer (Pos (Succ Zero))) (Integer (Pos Zero)) == GT) `quot` reduce2D (Integer vuz30 * signumReal1 (Integer (Pos (Succ Zero))) (compare (Integer (Pos (Succ Zero))) (Integer (Pos Zero)) == GT)) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];159 -> 165[label="",style="solid", color="black", weight=3];
160[label="Integer (Pos (Succ Zero)) `quot` gcd2 (Integer vuz30 * signumReal2 (Integer (Pos (Succ Zero))) False == fromInt (Pos Zero)) (Integer vuz30 * signumReal2 (Integer (Pos (Succ Zero))) False) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];160 -> 166[label="",style="solid", color="black", weight=3];
161[label="Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (compare (Integer (Pos (Succ vuz3100))) (fromInt (Pos Zero)) == GT) `quot` reduce2D (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (compare (Integer (Pos (Succ vuz3100))) (fromInt (Pos Zero)) == GT)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];161 -> 167[label="",style="solid", color="black", weight=3];
162[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal2 (Integer (Pos (Succ vuz3100))) (primEqInt (Pos (Succ vuz3100)) (Pos Zero)) == fromInt (Pos Zero)) (Integer vuz30 * signumReal2 (Integer (Pos (Succ vuz3100))) (primEqInt (Pos (Succ vuz3100)) (Pos Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];162 -> 168[label="",style="solid", color="black", weight=3];
163[label="Integer vuz30 * signumReal2 (Integer (Neg (Succ vuz3100))) (primEqInt (Neg (Succ vuz3100)) (Pos Zero)) `quot` reduce2D (Integer vuz30 * signumReal2 (Integer (Neg (Succ vuz3100))) (primEqInt (Neg (Succ vuz3100)) (Pos Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];163 -> 169[label="",style="solid", color="black", weight=3];
164[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal3 (Integer (Neg (Succ vuz3100))) == fromInt (Pos Zero)) (Integer vuz30 * signumReal3 (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];164 -> 170[label="",style="solid", color="black", weight=3];
165[label="Integer vuz30 * signumReal1 (Integer (Pos (Succ Zero))) (primCmpInt (Pos (Succ Zero)) (Pos Zero) == GT) `quot` reduce2D (Integer vuz30 * signumReal1 (Integer (Pos (Succ Zero))) (primCmpInt (Pos (Succ Zero)) (Pos Zero) == GT)) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];165 -> 171[label="",style="solid", color="black", weight=3];
166[label="Integer (Pos (Succ Zero)) `quot` gcd2 (Integer vuz30 * signumReal1 (Integer (Pos (Succ Zero))) (Integer (Pos (Succ Zero)) > fromInt (Pos Zero)) == fromInt (Pos Zero)) (Integer vuz30 * signumReal1 (Integer (Pos (Succ Zero))) (Integer (Pos (Succ Zero)) > fromInt (Pos Zero))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];166 -> 172[label="",style="solid", color="black", weight=3];
167[label="Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (compare (Integer (Pos (Succ vuz3100))) (Integer (Pos Zero)) == GT) `quot` reduce2D (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (compare (Integer (Pos (Succ vuz3100))) (Integer (Pos Zero)) == GT)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];167 -> 173[label="",style="solid", color="black", weight=3];
168[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal2 (Integer (Pos (Succ vuz3100))) False == fromInt (Pos Zero)) (Integer vuz30 * signumReal2 (Integer (Pos (Succ vuz3100))) False) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];168 -> 174[label="",style="solid", color="black", weight=3];
169[label="Integer vuz30 * signumReal2 (Integer (Neg (Succ vuz3100))) False `quot` reduce2D (Integer vuz30 * signumReal2 (Integer (Neg (Succ vuz3100))) False) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];169 -> 175[label="",style="solid", color="black", weight=3];
170[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal2 (Integer (Neg (Succ vuz3100))) (Integer (Neg (Succ vuz3100)) == fromInt (Pos Zero)) == fromInt (Pos Zero)) (Integer vuz30 * signumReal2 (Integer (Neg (Succ vuz3100))) (Integer (Neg (Succ vuz3100)) == fromInt (Pos Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];170 -> 176[label="",style="solid", color="black", weight=3];
171[label="Integer vuz30 * signumReal1 (Integer (Pos (Succ Zero))) (primCmpNat (Succ Zero) Zero == GT) `quot` reduce2D (Integer vuz30 * signumReal1 (Integer (Pos (Succ Zero))) (primCmpNat (Succ Zero) Zero == GT)) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];171 -> 177[label="",style="solid", color="black", weight=3];
172[label="Integer (Pos (Succ Zero)) `quot` gcd2 (Integer vuz30 * signumReal1 (Integer (Pos (Succ Zero))) (compare (Integer (Pos (Succ Zero))) (fromInt (Pos Zero)) == GT) == fromInt (Pos Zero)) (Integer vuz30 * signumReal1 (Integer (Pos (Succ Zero))) (compare (Integer (Pos (Succ Zero))) (fromInt (Pos Zero)) == GT)) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];172 -> 178[label="",style="solid", color="black", weight=3];
173[label="Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (primCmpInt (Pos (Succ vuz3100)) (Pos Zero) == GT) `quot` reduce2D (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (primCmpInt (Pos (Succ vuz3100)) (Pos Zero) == GT)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];173 -> 179[label="",style="solid", color="black", weight=3];
174[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) > fromInt (Pos Zero)) == fromInt (Pos Zero)) (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) > fromInt (Pos Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];174 -> 180[label="",style="solid", color="black", weight=3];
175[label="Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (Integer (Neg (Succ vuz3100)) > fromInt (Pos Zero)) `quot` reduce2D (Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (Integer (Neg (Succ vuz3100)) > fromInt (Pos Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];175 -> 181[label="",style="solid", color="black", weight=3];
176[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal2 (Integer (Neg (Succ vuz3100))) (Integer (Neg (Succ vuz3100)) == Integer (Pos Zero)) == fromInt (Pos Zero)) (Integer vuz30 * signumReal2 (Integer (Neg (Succ vuz3100))) (Integer (Neg (Succ vuz3100)) == Integer (Pos Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];176 -> 182[label="",style="solid", color="black", weight=3];
177[label="Integer vuz30 * signumReal1 (Integer (Pos (Succ Zero))) (GT == GT) `quot` reduce2D (Integer vuz30 * signumReal1 (Integer (Pos (Succ Zero))) (GT == GT)) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];177 -> 183[label="",style="solid", color="black", weight=3];
178[label="Integer (Pos (Succ Zero)) `quot` gcd2 (Integer vuz30 * signumReal1 (Integer (Pos (Succ Zero))) (compare (Integer (Pos (Succ Zero))) (Integer (Pos Zero)) == GT) == fromInt (Pos Zero)) (Integer vuz30 * signumReal1 (Integer (Pos (Succ Zero))) (compare (Integer (Pos (Succ Zero))) (Integer (Pos Zero)) == GT)) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];178 -> 184[label="",style="solid", color="black", weight=3];
179[label="Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (primCmpNat (Succ vuz3100) Zero == GT) `quot` reduce2D (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (primCmpNat (Succ vuz3100) Zero == GT)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];179 -> 185[label="",style="solid", color="black", weight=3];
180[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (compare (Integer (Pos (Succ vuz3100))) (fromInt (Pos Zero)) == GT) == fromInt (Pos Zero)) (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (compare (Integer (Pos (Succ vuz3100))) (fromInt (Pos Zero)) == GT)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];180 -> 186[label="",style="solid", color="black", weight=3];
181[label="Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (compare (Integer (Neg (Succ vuz3100))) (fromInt (Pos Zero)) == GT) `quot` reduce2D (Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (compare (Integer (Neg (Succ vuz3100))) (fromInt (Pos Zero)) == GT)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];181 -> 187[label="",style="solid", color="black", weight=3];
182[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal2 (Integer (Neg (Succ vuz3100))) (primEqInt (Neg (Succ vuz3100)) (Pos Zero)) == fromInt (Pos Zero)) (Integer vuz30 * signumReal2 (Integer (Neg (Succ vuz3100))) (primEqInt (Neg (Succ vuz3100)) (Pos Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];182 -> 188[label="",style="solid", color="black", weight=3];
183[label="Integer vuz30 * signumReal1 (Integer (Pos (Succ Zero))) True `quot` reduce2D (Integer vuz30 * signumReal1 (Integer (Pos (Succ Zero))) True) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];183 -> 189[label="",style="solid", color="black", weight=3];
184[label="Integer (Pos (Succ Zero)) `quot` gcd2 (Integer vuz30 * signumReal1 (Integer (Pos (Succ Zero))) (primCmpInt (Pos (Succ Zero)) (Pos Zero) == GT) == fromInt (Pos Zero)) (Integer vuz30 * signumReal1 (Integer (Pos (Succ Zero))) (primCmpInt (Pos (Succ Zero)) (Pos Zero) == GT)) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];184 -> 190[label="",style="solid", color="black", weight=3];
185[label="Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (GT == GT) `quot` reduce2D (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (GT == GT)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];185 -> 191[label="",style="solid", color="black", weight=3];
186[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (compare (Integer (Pos (Succ vuz3100))) (Integer (Pos Zero)) == GT) == fromInt (Pos Zero)) (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (compare (Integer (Pos (Succ vuz3100))) (Integer (Pos Zero)) == GT)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];186 -> 192[label="",style="solid", color="black", weight=3];
187[label="Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (compare (Integer (Neg (Succ vuz3100))) (Integer (Pos Zero)) == GT) `quot` reduce2D (Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (compare (Integer (Neg (Succ vuz3100))) (Integer (Pos Zero)) == GT)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];187 -> 193[label="",style="solid", color="black", weight=3];
188[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal2 (Integer (Neg (Succ vuz3100))) False == fromInt (Pos Zero)) (Integer vuz30 * signumReal2 (Integer (Neg (Succ vuz3100))) False) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];188 -> 194[label="",style="solid", color="black", weight=3];
189[label="Integer vuz30 * fromInt (Pos (Succ Zero)) `quot` reduce2D (Integer vuz30 * fromInt (Pos (Succ Zero))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];189 -> 195[label="",style="solid", color="black", weight=3];
190[label="Integer (Pos (Succ Zero)) `quot` gcd2 (Integer vuz30 * signumReal1 (Integer (Pos (Succ Zero))) (primCmpNat (Succ Zero) Zero == GT) == fromInt (Pos Zero)) (Integer vuz30 * signumReal1 (Integer (Pos (Succ Zero))) (primCmpNat (Succ Zero) Zero == GT)) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];190 -> 196[label="",style="solid", color="black", weight=3];
191[label="Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) True `quot` reduce2D (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) True) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];191 -> 197[label="",style="solid", color="black", weight=3];
192[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (primCmpInt (Pos (Succ vuz3100)) (Pos Zero) == GT) == fromInt (Pos Zero)) (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (primCmpInt (Pos (Succ vuz3100)) (Pos Zero) == GT)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];192 -> 198[label="",style="solid", color="black", weight=3];
193[label="Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (primCmpInt (Neg (Succ vuz3100)) (Pos Zero) == GT) `quot` reduce2D (Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (primCmpInt (Neg (Succ vuz3100)) (Pos Zero) == GT)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];193 -> 199[label="",style="solid", color="black", weight=3];
194[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (Integer (Neg (Succ vuz3100)) > fromInt (Pos Zero)) == fromInt (Pos Zero)) (Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (Integer (Neg (Succ vuz3100)) > fromInt (Pos Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];194 -> 200[label="",style="solid", color="black", weight=3];
195[label="Integer vuz30 * Integer (Pos (Succ Zero)) `quot` reduce2D (Integer vuz30 * Integer (Pos (Succ Zero))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];195 -> 201[label="",style="solid", color="black", weight=3];
196[label="Integer (Pos (Succ Zero)) `quot` gcd2 (Integer vuz30 * signumReal1 (Integer (Pos (Succ Zero))) (GT == GT) == fromInt (Pos Zero)) (Integer vuz30 * signumReal1 (Integer (Pos (Succ Zero))) (GT == GT)) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];196 -> 202[label="",style="solid", color="black", weight=3];
197[label="Integer vuz30 * fromInt (Pos (Succ Zero)) `quot` reduce2D (Integer vuz30 * fromInt (Pos (Succ Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];197 -> 203[label="",style="solid", color="black", weight=3];
198[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (primCmpNat (Succ vuz3100) Zero == GT) == fromInt (Pos Zero)) (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (primCmpNat (Succ vuz3100) Zero == GT)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];198 -> 204[label="",style="solid", color="black", weight=3];
199[label="Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (LT == GT) `quot` reduce2D (Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (LT == GT)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];199 -> 205[label="",style="solid", color="black", weight=3];
200[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (compare (Integer (Neg (Succ vuz3100))) (fromInt (Pos Zero)) == GT) == fromInt (Pos Zero)) (Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (compare (Integer (Neg (Succ vuz3100))) (fromInt (Pos Zero)) == GT)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];200 -> 206[label="",style="solid", color="black", weight=3];
201[label="Integer (primMulInt vuz30 (Pos (Succ Zero))) `quot` reduce2D (Integer (primMulInt vuz30 (Pos (Succ Zero)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];201 -> 207[label="",style="solid", color="black", weight=3];
202[label="Integer (Pos (Succ Zero)) `quot` gcd2 (Integer vuz30 * signumReal1 (Integer (Pos (Succ Zero))) True == fromInt (Pos Zero)) (Integer vuz30 * signumReal1 (Integer (Pos (Succ Zero))) True) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];202 -> 208[label="",style="solid", color="black", weight=3];
203[label="Integer vuz30 * Integer (Pos (Succ Zero)) `quot` reduce2D (Integer vuz30 * Integer (Pos (Succ Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];203 -> 209[label="",style="solid", color="black", weight=3];
204[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (GT == GT) == fromInt (Pos Zero)) (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (GT == GT)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];204 -> 210[label="",style="solid", color="black", weight=3];
205[label="Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) False `quot` reduce2D (Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) False) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];205 -> 211[label="",style="solid", color="black", weight=3];
206[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (compare (Integer (Neg (Succ vuz3100))) (Integer (Pos Zero)) == GT) == fromInt (Pos Zero)) (Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (compare (Integer (Neg (Succ vuz3100))) (Integer (Pos Zero)) == GT)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];206 -> 212[label="",style="solid", color="black", weight=3];
207[label="Integer (primMulInt vuz30 (Pos (Succ Zero))) `quot` gcd (Integer (primMulInt vuz30 (Pos (Succ Zero)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];207 -> 213[label="",style="solid", color="black", weight=3];
208[label="Integer (Pos (Succ Zero)) `quot` gcd2 (Integer vuz30 * fromInt (Pos (Succ Zero)) == fromInt (Pos Zero)) (Integer vuz30 * fromInt (Pos (Succ Zero))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];208 -> 214[label="",style="solid", color="black", weight=3];
209[label="Integer (primMulInt vuz30 (Pos (Succ Zero))) `quot` reduce2D (Integer (primMulInt vuz30 (Pos (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];209 -> 215[label="",style="solid", color="black", weight=3];
210[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) True == fromInt (Pos Zero)) (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) True) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];210 -> 216[label="",style="solid", color="black", weight=3];
211[label="Integer vuz30 * signumReal0 (Integer (Neg (Succ vuz3100))) otherwise `quot` reduce2D (Integer vuz30 * signumReal0 (Integer (Neg (Succ vuz3100))) otherwise) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];211 -> 217[label="",style="solid", color="black", weight=3];
212[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (primCmpInt (Neg (Succ vuz3100)) (Pos Zero) == GT) == fromInt (Pos Zero)) (Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (primCmpInt (Neg (Succ vuz3100)) (Pos Zero) == GT)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];212 -> 218[label="",style="solid", color="black", weight=3];
213[label="Integer (primMulInt vuz30 (Pos (Succ Zero))) `quot` gcd3 (Integer (primMulInt vuz30 (Pos (Succ Zero)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];213 -> 219[label="",style="solid", color="black", weight=3];
214[label="Integer (Pos (Succ Zero)) `quot` gcd2 (Integer vuz30 * Integer (Pos (Succ Zero)) == fromInt (Pos Zero)) (Integer vuz30 * Integer (Pos (Succ Zero))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];214 -> 220[label="",style="solid", color="black", weight=3];
215[label="Integer (primMulInt vuz30 (Pos (Succ Zero))) `quot` gcd (Integer (primMulInt vuz30 (Pos (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];215 -> 221[label="",style="solid", color="black", weight=3];
216[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * fromInt (Pos (Succ Zero)) == fromInt (Pos Zero)) (Integer vuz30 * fromInt (Pos (Succ Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];216 -> 222[label="",style="solid", color="black", weight=3];
217[label="Integer vuz30 * signumReal0 (Integer (Neg (Succ vuz3100))) True `quot` reduce2D (Integer vuz30 * signumReal0 (Integer (Neg (Succ vuz3100))) True) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];217 -> 223[label="",style="solid", color="black", weight=3];
218[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (LT == GT) == fromInt (Pos Zero)) (Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (LT == GT)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];218 -> 224[label="",style="solid", color="black", weight=3];
219[label="Integer (primMulInt vuz30 (Pos (Succ Zero))) `quot` gcd2 (Integer (primMulInt vuz30 (Pos (Succ Zero))) == fromInt (Pos Zero)) (Integer (primMulInt vuz30 (Pos (Succ Zero)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];219 -> 225[label="",style="solid", color="black", weight=3];
220[label="Integer (Pos (Succ Zero)) `quot` gcd2 (Integer (primMulInt vuz30 (Pos (Succ Zero))) == fromInt (Pos Zero)) (Integer (primMulInt vuz30 (Pos (Succ Zero)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];220 -> 226[label="",style="solid", color="black", weight=3];
221[label="Integer (primMulInt vuz30 (Pos (Succ Zero))) `quot` gcd3 (Integer (primMulInt vuz30 (Pos (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];221 -> 227[label="",style="solid", color="black", weight=3];
222[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * Integer (Pos (Succ Zero)) == fromInt (Pos Zero)) (Integer vuz30 * Integer (Pos (Succ Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];222 -> 228[label="",style="solid", color="black", weight=3];
223[label="Integer vuz30 * fromInt (Neg (Succ Zero)) `quot` reduce2D (Integer vuz30 * fromInt (Neg (Succ Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];223 -> 229[label="",style="solid", color="black", weight=3];
224[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) False == fromInt (Pos Zero)) (Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) False) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];224 -> 230[label="",style="solid", color="black", weight=3];
225[label="Integer (primMulInt vuz30 (Pos (Succ Zero))) `quot` gcd2 (Integer (primMulInt vuz30 (Pos (Succ Zero))) == Integer (Pos Zero)) (Integer (primMulInt vuz30 (Pos (Succ Zero)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];225 -> 231[label="",style="solid", color="black", weight=3];
226[label="Integer (Pos (Succ Zero)) `quot` gcd2 (Integer (primMulInt vuz30 (Pos (Succ Zero))) == Integer (Pos Zero)) (Integer (primMulInt vuz30 (Pos (Succ Zero)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];226 -> 232[label="",style="solid", color="black", weight=3];
227[label="Integer (primMulInt vuz30 (Pos (Succ Zero))) `quot` gcd2 (Integer (primMulInt vuz30 (Pos (Succ Zero))) == fromInt (Pos Zero)) (Integer (primMulInt vuz30 (Pos (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];227 -> 233[label="",style="solid", color="black", weight=3];
228[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer (primMulInt vuz30 (Pos (Succ Zero))) == fromInt (Pos Zero)) (Integer (primMulInt vuz30 (Pos (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];228 -> 234[label="",style="solid", color="black", weight=3];
229[label="Integer vuz30 * Integer (Neg (Succ Zero)) `quot` reduce2D (Integer vuz30 * Integer (Neg (Succ Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];229 -> 235[label="",style="solid", color="black", weight=3];
230[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal0 (Integer (Neg (Succ vuz3100))) otherwise == fromInt (Pos Zero)) (Integer vuz30 * signumReal0 (Integer (Neg (Succ vuz3100))) otherwise) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];230 -> 236[label="",style="solid", color="black", weight=3];
231[label="Integer (primMulInt vuz30 (Pos (Succ Zero))) `quot` gcd2 (primEqInt (primMulInt vuz30 (Pos (Succ Zero))) (Pos Zero)) (Integer (primMulInt vuz30 (Pos (Succ Zero)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="burlywood",shape="box"];3496[label="vuz30/Pos vuz300",fontsize=10,color="white",style="solid",shape="box"];231 -> 3496[label="",style="solid", color="burlywood", weight=9];
3496 -> 237[label="",style="solid", color="burlywood", weight=3];
3497[label="vuz30/Neg vuz300",fontsize=10,color="white",style="solid",shape="box"];231 -> 3497[label="",style="solid", color="burlywood", weight=9];
3497 -> 238[label="",style="solid", color="burlywood", weight=3];
232[label="Integer (Pos (Succ Zero)) `quot` gcd2 (primEqInt (primMulInt vuz30 (Pos (Succ Zero))) (Pos Zero)) (Integer (primMulInt vuz30 (Pos (Succ Zero)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="burlywood",shape="box"];3498[label="vuz30/Pos vuz300",fontsize=10,color="white",style="solid",shape="box"];232 -> 3498[label="",style="solid", color="burlywood", weight=9];
3498 -> 239[label="",style="solid", color="burlywood", weight=3];
3499[label="vuz30/Neg vuz300",fontsize=10,color="white",style="solid",shape="box"];232 -> 3499[label="",style="solid", color="burlywood", weight=9];
3499 -> 240[label="",style="solid", color="burlywood", weight=3];
233[label="Integer (primMulInt vuz30 (Pos (Succ Zero))) `quot` gcd2 (Integer (primMulInt vuz30 (Pos (Succ Zero))) == Integer (Pos Zero)) (Integer (primMulInt vuz30 (Pos (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];233 -> 241[label="",style="solid", color="black", weight=3];
234[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer (primMulInt vuz30 (Pos (Succ Zero))) == Integer (Pos Zero)) (Integer (primMulInt vuz30 (Pos (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];234 -> 242[label="",style="solid", color="black", weight=3];
235[label="Integer (primMulInt vuz30 (Neg (Succ Zero))) `quot` reduce2D (Integer (primMulInt vuz30 (Neg (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];235 -> 243[label="",style="solid", color="black", weight=3];
236[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal0 (Integer (Neg (Succ vuz3100))) True == fromInt (Pos Zero)) (Integer vuz30 * signumReal0 (Integer (Neg (Succ vuz3100))) True) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];236 -> 244[label="",style="solid", color="black", weight=3];
237[label="Integer (primMulInt (Pos vuz300) (Pos (Succ Zero))) `quot` gcd2 (primEqInt (primMulInt (Pos vuz300) (Pos (Succ Zero))) (Pos Zero)) (Integer (primMulInt (Pos vuz300) (Pos (Succ Zero)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];237 -> 245[label="",style="solid", color="black", weight=3];
238[label="Integer (primMulInt (Neg vuz300) (Pos (Succ Zero))) `quot` gcd2 (primEqInt (primMulInt (Neg vuz300) (Pos (Succ Zero))) (Pos Zero)) (Integer (primMulInt (Neg vuz300) (Pos (Succ Zero)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];238 -> 246[label="",style="solid", color="black", weight=3];
239[label="Integer (Pos (Succ Zero)) `quot` gcd2 (primEqInt (primMulInt (Pos vuz300) (Pos (Succ Zero))) (Pos Zero)) (Integer (primMulInt (Pos vuz300) (Pos (Succ Zero)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];239 -> 247[label="",style="solid", color="black", weight=3];
240[label="Integer (Pos (Succ Zero)) `quot` gcd2 (primEqInt (primMulInt (Neg vuz300) (Pos (Succ Zero))) (Pos Zero)) (Integer (primMulInt (Neg vuz300) (Pos (Succ Zero)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];240 -> 248[label="",style="solid", color="black", weight=3];
241[label="Integer (primMulInt vuz30 (Pos (Succ Zero))) `quot` gcd2 (primEqInt (primMulInt vuz30 (Pos (Succ Zero))) (Pos Zero)) (Integer (primMulInt vuz30 (Pos (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="burlywood",shape="box"];3500[label="vuz30/Pos vuz300",fontsize=10,color="white",style="solid",shape="box"];241 -> 3500[label="",style="solid", color="burlywood", weight=9];
3500 -> 249[label="",style="solid", color="burlywood", weight=3];
3501[label="vuz30/Neg vuz300",fontsize=10,color="white",style="solid",shape="box"];241 -> 3501[label="",style="solid", color="burlywood", weight=9];
3501 -> 250[label="",style="solid", color="burlywood", weight=3];
242[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (primEqInt (primMulInt vuz30 (Pos (Succ Zero))) (Pos Zero)) (Integer (primMulInt vuz30 (Pos (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="burlywood",shape="box"];3502[label="vuz30/Pos vuz300",fontsize=10,color="white",style="solid",shape="box"];242 -> 3502[label="",style="solid", color="burlywood", weight=9];
3502 -> 251[label="",style="solid", color="burlywood", weight=3];
3503[label="vuz30/Neg vuz300",fontsize=10,color="white",style="solid",shape="box"];242 -> 3503[label="",style="solid", color="burlywood", weight=9];
3503 -> 252[label="",style="solid", color="burlywood", weight=3];
243[label="Integer (primMulInt vuz30 (Neg (Succ Zero))) `quot` gcd (Integer (primMulInt vuz30 (Neg (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];243 -> 253[label="",style="solid", color="black", weight=3];
244[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * fromInt (Neg (Succ Zero)) == fromInt (Pos Zero)) (Integer vuz30 * fromInt (Neg (Succ Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];244 -> 254[label="",style="solid", color="black", weight=3];
245 -> 921[label="",style="dashed", color="red", weight=0];
245[label="Integer (Pos (primMulNat vuz300 (Succ Zero))) `quot` gcd2 (primEqInt (Pos (primMulNat vuz300 (Succ Zero))) (Pos Zero)) (Integer (Pos (primMulNat vuz300 (Succ Zero)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="magenta"];245 -> 922[label="",style="dashed", color="magenta", weight=3];
245 -> 923[label="",style="dashed", color="magenta", weight=3];
245 -> 924[label="",style="dashed", color="magenta", weight=3];
245 -> 925[label="",style="dashed", color="magenta", weight=3];
246 -> 1107[label="",style="dashed", color="red", weight=0];
246[label="Integer (Neg (primMulNat vuz300 (Succ Zero))) `quot` gcd2 (primEqInt (Neg (primMulNat vuz300 (Succ Zero))) (Pos Zero)) (Integer (Neg (primMulNat vuz300 (Succ Zero)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="magenta"];246 -> 1108[label="",style="dashed", color="magenta", weight=3];
246 -> 1109[label="",style="dashed", color="magenta", weight=3];
246 -> 1110[label="",style="dashed", color="magenta", weight=3];
246 -> 1111[label="",style="dashed", color="magenta", weight=3];
247 -> 921[label="",style="dashed", color="red", weight=0];
247[label="Integer (Pos (Succ Zero)) `quot` gcd2 (primEqInt (Pos (primMulNat vuz300 (Succ Zero))) (Pos Zero)) (Integer (Pos (primMulNat vuz300 (Succ Zero)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="magenta"];247 -> 926[label="",style="dashed", color="magenta", weight=3];
247 -> 927[label="",style="dashed", color="magenta", weight=3];
247 -> 928[label="",style="dashed", color="magenta", weight=3];
247 -> 929[label="",style="dashed", color="magenta", weight=3];
248 -> 1218[label="",style="dashed", color="red", weight=0];
248[label="Integer (Pos (Succ Zero)) `quot` gcd2 (primEqInt (Neg (primMulNat vuz300 (Succ Zero))) (Pos Zero)) (Integer (Neg (primMulNat vuz300 (Succ Zero)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="magenta"];248 -> 1219[label="",style="dashed", color="magenta", weight=3];
248 -> 1220[label="",style="dashed", color="magenta", weight=3];
248 -> 1221[label="",style="dashed", color="magenta", weight=3];
249[label="Integer (primMulInt (Pos vuz300) (Pos (Succ Zero))) `quot` gcd2 (primEqInt (primMulInt (Pos vuz300) (Pos (Succ Zero))) (Pos Zero)) (Integer (primMulInt (Pos vuz300) (Pos (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];249 -> 263[label="",style="solid", color="black", weight=3];
250[label="Integer (primMulInt (Neg vuz300) (Pos (Succ Zero))) `quot` gcd2 (primEqInt (primMulInt (Neg vuz300) (Pos (Succ Zero))) (Pos Zero)) (Integer (primMulInt (Neg vuz300) (Pos (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];250 -> 264[label="",style="solid", color="black", weight=3];
251[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (primEqInt (primMulInt (Pos vuz300) (Pos (Succ Zero))) (Pos Zero)) (Integer (primMulInt (Pos vuz300) (Pos (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];251 -> 265[label="",style="solid", color="black", weight=3];
252[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (primEqInt (primMulInt (Neg vuz300) (Pos (Succ Zero))) (Pos Zero)) (Integer (primMulInt (Neg vuz300) (Pos (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];252 -> 266[label="",style="solid", color="black", weight=3];
253[label="Integer (primMulInt vuz30 (Neg (Succ Zero))) `quot` gcd3 (Integer (primMulInt vuz30 (Neg (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];253 -> 267[label="",style="solid", color="black", weight=3];
254[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * Integer (Neg (Succ Zero)) == fromInt (Pos Zero)) (Integer vuz30 * Integer (Neg (Succ Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];254 -> 268[label="",style="solid", color="black", weight=3];
922 -> 749[label="",style="dashed", color="red", weight=0];
922[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];922 -> 1082[label="",style="dashed", color="magenta", weight=3];
923 -> 749[label="",style="dashed", color="red", weight=0];
923[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];923 -> 1083[label="",style="dashed", color="magenta", weight=3];
924[label="Zero",fontsize=16,color="green",shape="box"];925 -> 749[label="",style="dashed", color="red", weight=0];
925[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];925 -> 1084[label="",style="dashed", color="magenta", weight=3];
921[label="Integer (Pos vuz72) `quot` gcd2 (primEqInt (Pos vuz74) (Pos Zero)) (Integer (Pos vuz73)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="burlywood",shape="triangle"];3511[label="vuz74/Succ vuz740",fontsize=10,color="white",style="solid",shape="box"];921 -> 3511[label="",style="solid", color="burlywood", weight=9];
3511 -> 1085[label="",style="solid", color="burlywood", weight=3];
3512[label="vuz74/Zero",fontsize=10,color="white",style="solid",shape="box"];921 -> 3512[label="",style="solid", color="burlywood", weight=9];
3512 -> 1086[label="",style="solid", color="burlywood", weight=3];
1108 -> 749[label="",style="dashed", color="red", weight=0];
1108[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];1108 -> 1199[label="",style="dashed", color="magenta", weight=3];
1109[label="Zero",fontsize=16,color="green",shape="box"];1110 -> 749[label="",style="dashed", color="red", weight=0];
1110[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];1110 -> 1200[label="",style="dashed", color="magenta", weight=3];
1111 -> 749[label="",style="dashed", color="red", weight=0];
1111[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];1111 -> 1201[label="",style="dashed", color="magenta", weight=3];
1107[label="Integer (Neg vuz81) `quot` gcd2 (primEqInt (Neg vuz83) (Pos Zero)) (Integer (Neg vuz82)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="burlywood",shape="triangle"];3516[label="vuz83/Succ vuz830",fontsize=10,color="white",style="solid",shape="box"];1107 -> 3516[label="",style="solid", color="burlywood", weight=9];
3516 -> 1202[label="",style="solid", color="burlywood", weight=3];
3517[label="vuz83/Zero",fontsize=10,color="white",style="solid",shape="box"];1107 -> 3517[label="",style="solid", color="burlywood", weight=9];
3517 -> 1203[label="",style="solid", color="burlywood", weight=3];
926 -> 749[label="",style="dashed", color="red", weight=0];
926[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];926 -> 1087[label="",style="dashed", color="magenta", weight=3];
927[label="Succ Zero",fontsize=16,color="green",shape="box"];928[label="Zero",fontsize=16,color="green",shape="box"];929 -> 749[label="",style="dashed", color="red", weight=0];
929[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];929 -> 1088[label="",style="dashed", color="magenta", weight=3];
1219 -> 749[label="",style="dashed", color="red", weight=0];
1219[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];1219 -> 1270[label="",style="dashed", color="magenta", weight=3];
1220[label="Zero",fontsize=16,color="green",shape="box"];1221 -> 749[label="",style="dashed", color="red", weight=0];
1221[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];1221 -> 1271[label="",style="dashed", color="magenta", weight=3];
1218[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (primEqInt (Neg vuz91) (Pos Zero)) (Integer (Neg vuz90)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="burlywood",shape="triangle"];3522[label="vuz91/Succ vuz910",fontsize=10,color="white",style="solid",shape="box"];1218 -> 3522[label="",style="solid", color="burlywood", weight=9];
3522 -> 1272[label="",style="solid", color="burlywood", weight=3];
3523[label="vuz91/Zero",fontsize=10,color="white",style="solid",shape="box"];1218 -> 3523[label="",style="solid", color="burlywood", weight=9];
3523 -> 1273[label="",style="solid", color="burlywood", weight=3];
263 -> 921[label="",style="dashed", color="red", weight=0];
263[label="Integer (Pos (primMulNat vuz300 (Succ Zero))) `quot` gcd2 (primEqInt (Pos (primMulNat vuz300 (Succ Zero))) (Pos Zero)) (Integer (Pos (primMulNat vuz300 (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="magenta"];263 -> 934[label="",style="dashed", color="magenta", weight=3];
263 -> 935[label="",style="dashed", color="magenta", weight=3];
263 -> 936[label="",style="dashed", color="magenta", weight=3];
264 -> 1107[label="",style="dashed", color="red", weight=0];
264[label="Integer (Neg (primMulNat vuz300 (Succ Zero))) `quot` gcd2 (primEqInt (Neg (primMulNat vuz300 (Succ Zero))) (Pos Zero)) (Integer (Neg (primMulNat vuz300 (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="magenta"];264 -> 1112[label="",style="dashed", color="magenta", weight=3];
264 -> 1113[label="",style="dashed", color="magenta", weight=3];
264 -> 1114[label="",style="dashed", color="magenta", weight=3];
265 -> 921[label="",style="dashed", color="red", weight=0];
265[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (primEqInt (Pos (primMulNat vuz300 (Succ Zero))) (Pos Zero)) (Integer (Pos (primMulNat vuz300 (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="magenta"];265 -> 937[label="",style="dashed", color="magenta", weight=3];
265 -> 938[label="",style="dashed", color="magenta", weight=3];
265 -> 939[label="",style="dashed", color="magenta", weight=3];
266 -> 1218[label="",style="dashed", color="red", weight=0];
266[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (primEqInt (Neg (primMulNat vuz300 (Succ Zero))) (Pos Zero)) (Integer (Neg (primMulNat vuz300 (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="magenta"];266 -> 1225[label="",style="dashed", color="magenta", weight=3];
266 -> 1226[label="",style="dashed", color="magenta", weight=3];
267[label="Integer (primMulInt vuz30 (Neg (Succ Zero))) `quot` gcd2 (Integer (primMulInt vuz30 (Neg (Succ Zero))) == fromInt (Pos Zero)) (Integer (primMulInt vuz30 (Neg (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];267 -> 285[label="",style="solid", color="black", weight=3];
268[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer (primMulInt vuz30 (Neg (Succ Zero))) == fromInt (Pos Zero)) (Integer (primMulInt vuz30 (Neg (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];268 -> 286[label="",style="solid", color="black", weight=3];
1082[label="vuz300",fontsize=16,color="green",shape="box"];749[label="primMulNat vuz3000 (Succ Zero)",fontsize=16,color="burlywood",shape="triangle"];3528[label="vuz3000/Succ vuz30000",fontsize=10,color="white",style="solid",shape="box"];749 -> 3528[label="",style="solid", color="burlywood", weight=9];
3528 -> 765[label="",style="solid", color="burlywood", weight=3];
3529[label="vuz3000/Zero",fontsize=10,color="white",style="solid",shape="box"];749 -> 3529[label="",style="solid", color="burlywood", weight=9];
3529 -> 766[label="",style="solid", color="burlywood", weight=3];
1083[label="vuz300",fontsize=16,color="green",shape="box"];1084[label="vuz300",fontsize=16,color="green",shape="box"];1085[label="Integer (Pos vuz72) `quot` gcd2 (primEqInt (Pos (Succ vuz740)) (Pos Zero)) (Integer (Pos vuz73)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1085 -> 1204[label="",style="solid", color="black", weight=3];
1086[label="Integer (Pos vuz72) `quot` gcd2 (primEqInt (Pos Zero) (Pos Zero)) (Integer (Pos vuz73)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1086 -> 1205[label="",style="solid", color="black", weight=3];
1199[label="vuz300",fontsize=16,color="green",shape="box"];1200[label="vuz300",fontsize=16,color="green",shape="box"];1201[label="vuz300",fontsize=16,color="green",shape="box"];1202[label="Integer (Neg vuz81) `quot` gcd2 (primEqInt (Neg (Succ vuz830)) (Pos Zero)) (Integer (Neg vuz82)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1202 -> 1274[label="",style="solid", color="black", weight=3];
1203[label="Integer (Neg vuz81) `quot` gcd2 (primEqInt (Neg Zero) (Pos Zero)) (Integer (Neg vuz82)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1203 -> 1275[label="",style="solid", color="black", weight=3];
1087[label="vuz300",fontsize=16,color="green",shape="box"];1088[label="vuz300",fontsize=16,color="green",shape="box"];1270[label="vuz300",fontsize=16,color="green",shape="box"];1271[label="vuz300",fontsize=16,color="green",shape="box"];1272[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (primEqInt (Neg (Succ vuz910)) (Pos Zero)) (Integer (Neg vuz90)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1272 -> 1282[label="",style="solid", color="black", weight=3];
1273[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (primEqInt (Neg Zero) (Pos Zero)) (Integer (Neg vuz90)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1273 -> 1283[label="",style="solid", color="black", weight=3];
934 -> 749[label="",style="dashed", color="red", weight=0];
934[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];934 -> 1091[label="",style="dashed", color="magenta", weight=3];
935 -> 749[label="",style="dashed", color="red", weight=0];
935[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];935 -> 1092[label="",style="dashed", color="magenta", weight=3];
936 -> 749[label="",style="dashed", color="red", weight=0];
936[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];936 -> 1093[label="",style="dashed", color="magenta", weight=3];
1112 -> 749[label="",style="dashed", color="red", weight=0];
1112[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];1112 -> 1206[label="",style="dashed", color="magenta", weight=3];
1113 -> 749[label="",style="dashed", color="red", weight=0];
1113[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];1113 -> 1207[label="",style="dashed", color="magenta", weight=3];
1114 -> 749[label="",style="dashed", color="red", weight=0];
1114[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];1114 -> 1208[label="",style="dashed", color="magenta", weight=3];
937 -> 749[label="",style="dashed", color="red", weight=0];
937[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];937 -> 1094[label="",style="dashed", color="magenta", weight=3];
938[label="Succ vuz3100",fontsize=16,color="green",shape="box"];939 -> 749[label="",style="dashed", color="red", weight=0];
939[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];939 -> 1095[label="",style="dashed", color="magenta", weight=3];
1225 -> 749[label="",style="dashed", color="red", weight=0];
1225[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];1225 -> 1276[label="",style="dashed", color="magenta", weight=3];
1226 -> 749[label="",style="dashed", color="red", weight=0];
1226[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];1226 -> 1277[label="",style="dashed", color="magenta", weight=3];
285[label="Integer (primMulInt vuz30 (Neg (Succ Zero))) `quot` gcd2 (Integer (primMulInt vuz30 (Neg (Succ Zero))) == Integer (Pos Zero)) (Integer (primMulInt vuz30 (Neg (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];285 -> 307[label="",style="solid", color="black", weight=3];
286[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer (primMulInt vuz30 (Neg (Succ Zero))) == Integer (Pos Zero)) (Integer (primMulInt vuz30 (Neg (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];286 -> 308[label="",style="solid", color="black", weight=3];
765[label="primMulNat (Succ vuz30000) (Succ Zero)",fontsize=16,color="black",shape="box"];765 -> 774[label="",style="solid", color="black", weight=3];
766[label="primMulNat Zero (Succ Zero)",fontsize=16,color="black",shape="box"];766 -> 775[label="",style="solid", color="black", weight=3];
1204[label="Integer (Pos vuz72) `quot` gcd2 False (Integer (Pos vuz73)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1204 -> 1278[label="",style="solid", color="black", weight=3];
1205[label="Integer (Pos vuz72) `quot` gcd2 True (Integer (Pos vuz73)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1205 -> 1279[label="",style="solid", color="black", weight=3];
1274[label="Integer (Neg vuz81) `quot` gcd2 False (Integer (Neg vuz82)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1274 -> 1284[label="",style="solid", color="black", weight=3];
1275[label="Integer (Neg vuz81) `quot` gcd2 True (Integer (Neg vuz82)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1275 -> 1285[label="",style="solid", color="black", weight=3];
1282[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 False (Integer (Neg vuz90)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1282 -> 1288[label="",style="solid", color="black", weight=3];
1283[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 True (Integer (Neg vuz90)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1283 -> 1289[label="",style="solid", color="black", weight=3];
1091[label="vuz300",fontsize=16,color="green",shape="box"];1092[label="vuz300",fontsize=16,color="green",shape="box"];1093[label="vuz300",fontsize=16,color="green",shape="box"];1206[label="vuz300",fontsize=16,color="green",shape="box"];1207[label="vuz300",fontsize=16,color="green",shape="box"];1208[label="vuz300",fontsize=16,color="green",shape="box"];1094[label="vuz300",fontsize=16,color="green",shape="box"];1095[label="vuz300",fontsize=16,color="green",shape="box"];1276[label="vuz300",fontsize=16,color="green",shape="box"];1277[label="vuz300",fontsize=16,color="green",shape="box"];307[label="Integer (primMulInt vuz30 (Neg (Succ Zero))) `quot` gcd2 (primEqInt (primMulInt vuz30 (Neg (Succ Zero))) (Pos Zero)) (Integer (primMulInt vuz30 (Neg (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="burlywood",shape="box"];3540[label="vuz30/Pos vuz300",fontsize=10,color="white",style="solid",shape="box"];307 -> 3540[label="",style="solid", color="burlywood", weight=9];
3540 -> 333[label="",style="solid", color="burlywood", weight=3];
3541[label="vuz30/Neg vuz300",fontsize=10,color="white",style="solid",shape="box"];307 -> 3541[label="",style="solid", color="burlywood", weight=9];
3541 -> 334[label="",style="solid", color="burlywood", weight=3];
308[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (primEqInt (primMulInt vuz30 (Neg (Succ Zero))) (Pos Zero)) (Integer (primMulInt vuz30 (Neg (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="burlywood",shape="box"];3542[label="vuz30/Pos vuz300",fontsize=10,color="white",style="solid",shape="box"];308 -> 3542[label="",style="solid", color="burlywood", weight=9];
3542 -> 335[label="",style="solid", color="burlywood", weight=3];
3543[label="vuz30/Neg vuz300",fontsize=10,color="white",style="solid",shape="box"];308 -> 3543[label="",style="solid", color="burlywood", weight=9];
3543 -> 336[label="",style="solid", color="burlywood", weight=3];
774 -> 798[label="",style="dashed", color="red", weight=0];
774[label="primPlusNat (primMulNat vuz30000 (Succ Zero)) (Succ Zero)",fontsize=16,color="magenta"];774 -> 799[label="",style="dashed", color="magenta", weight=3];
775[label="Zero",fontsize=16,color="green",shape="box"];1278[label="Integer (Pos vuz72) `quot` gcd0 (Integer (Pos vuz73)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="triangle"];1278 -> 1286[label="",style="solid", color="black", weight=3];
1279[label="Integer (Pos vuz72) `quot` gcd1 (Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos vuz73)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1279 -> 1287[label="",style="solid", color="black", weight=3];
1284[label="Integer (Neg vuz81) `quot` gcd0 (Integer (Neg vuz82)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="triangle"];1284 -> 1290[label="",style="solid", color="black", weight=3];
1285[label="Integer (Neg vuz81) `quot` gcd1 (Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Neg vuz82)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1285 -> 1291[label="",style="solid", color="black", weight=3];
1288[label="Integer (Pos (Succ vuz3100)) `quot` gcd0 (Integer (Neg vuz90)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="triangle"];1288 -> 1294[label="",style="solid", color="black", weight=3];
1289[label="Integer (Pos (Succ vuz3100)) `quot` gcd1 (Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Neg vuz90)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1289 -> 1295[label="",style="solid", color="black", weight=3];
333[label="Integer (primMulInt (Pos vuz300) (Neg (Succ Zero))) `quot` gcd2 (primEqInt (primMulInt (Pos vuz300) (Neg (Succ Zero))) (Pos Zero)) (Integer (primMulInt (Pos vuz300) (Neg (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];333 -> 365[label="",style="solid", color="black", weight=3];
334[label="Integer (primMulInt (Neg vuz300) (Neg (Succ Zero))) `quot` gcd2 (primEqInt (primMulInt (Neg vuz300) (Neg (Succ Zero))) (Pos Zero)) (Integer (primMulInt (Neg vuz300) (Neg (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];334 -> 366[label="",style="solid", color="black", weight=3];
335[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (primEqInt (primMulInt (Pos vuz300) (Neg (Succ Zero))) (Pos Zero)) (Integer (primMulInt (Pos vuz300) (Neg (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];335 -> 367[label="",style="solid", color="black", weight=3];
336[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (primEqInt (primMulInt (Neg vuz300) (Neg (Succ Zero))) (Pos Zero)) (Integer (primMulInt (Neg vuz300) (Neg (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];336 -> 368[label="",style="solid", color="black", weight=3];
799 -> 749[label="",style="dashed", color="red", weight=0];
799[label="primMulNat vuz30000 (Succ Zero)",fontsize=16,color="magenta"];799 -> 804[label="",style="dashed", color="magenta", weight=3];
798[label="primPlusNat vuz43 (Succ Zero)",fontsize=16,color="burlywood",shape="triangle"];3546[label="vuz43/Succ vuz430",fontsize=10,color="white",style="solid",shape="box"];798 -> 3546[label="",style="solid", color="burlywood", weight=9];
3546 -> 805[label="",style="solid", color="burlywood", weight=3];
3547[label="vuz43/Zero",fontsize=10,color="white",style="solid",shape="box"];798 -> 3547[label="",style="solid", color="burlywood", weight=9];
3547 -> 806[label="",style="solid", color="burlywood", weight=3];
1286[label="Integer (Pos vuz72) `quot` gcd0Gcd' (abs (Integer (Pos vuz73))) (abs (Integer (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];1286 -> 1292[label="",style="solid", color="black", weight=3];
1287[label="Integer (Pos vuz72) `quot` gcd1 (Integer (Pos (Succ vuz3100)) == Integer (Pos Zero)) (Integer (Pos vuz73)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1287 -> 1293[label="",style="solid", color="black", weight=3];
1290[label="Integer (Neg vuz81) `quot` gcd0Gcd' (abs (Integer (Neg vuz82))) (abs (Integer (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];1290 -> 1296[label="",style="solid", color="black", weight=3];
1291[label="Integer (Neg vuz81) `quot` gcd1 (Integer (Pos (Succ vuz3100)) == Integer (Pos Zero)) (Integer (Neg vuz82)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1291 -> 1297[label="",style="solid", color="black", weight=3];
1294[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd' (abs (Integer (Neg vuz90))) (abs (Integer (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];1294 -> 1300[label="",style="solid", color="black", weight=3];
1295[label="Integer (Pos (Succ vuz3100)) `quot` gcd1 (Integer (Pos (Succ vuz3100)) == Integer (Pos Zero)) (Integer (Neg vuz90)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1295 -> 1301[label="",style="solid", color="black", weight=3];
365 -> 1107[label="",style="dashed", color="red", weight=0];
365[label="Integer (Neg (primMulNat vuz300 (Succ Zero))) `quot` gcd2 (primEqInt (Neg (primMulNat vuz300 (Succ Zero))) (Pos Zero)) (Integer (Neg (primMulNat vuz300 (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="magenta"];365 -> 1147[label="",style="dashed", color="magenta", weight=3];
365 -> 1148[label="",style="dashed", color="magenta", weight=3];
365 -> 1149[label="",style="dashed", color="magenta", weight=3];
365 -> 1150[label="",style="dashed", color="magenta", weight=3];
366 -> 921[label="",style="dashed", color="red", weight=0];
366[label="Integer (Pos (primMulNat vuz300 (Succ Zero))) `quot` gcd2 (primEqInt (Pos (primMulNat vuz300 (Succ Zero))) (Pos Zero)) (Integer (Pos (primMulNat vuz300 (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="magenta"];366 -> 984[label="",style="dashed", color="magenta", weight=3];
366 -> 985[label="",style="dashed", color="magenta", weight=3];
366 -> 986[label="",style="dashed", color="magenta", weight=3];
366 -> 987[label="",style="dashed", color="magenta", weight=3];
367 -> 1218[label="",style="dashed", color="red", weight=0];
367[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (primEqInt (Neg (primMulNat vuz300 (Succ Zero))) (Pos Zero)) (Integer (Neg (primMulNat vuz300 (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="magenta"];367 -> 1235[label="",style="dashed", color="magenta", weight=3];
367 -> 1236[label="",style="dashed", color="magenta", weight=3];
367 -> 1237[label="",style="dashed", color="magenta", weight=3];
368 -> 921[label="",style="dashed", color="red", weight=0];
368[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (primEqInt (Pos (primMulNat vuz300 (Succ Zero))) (Pos Zero)) (Integer (Pos (primMulNat vuz300 (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="magenta"];368 -> 988[label="",style="dashed", color="magenta", weight=3];
368 -> 989[label="",style="dashed", color="magenta", weight=3];
368 -> 990[label="",style="dashed", color="magenta", weight=3];
368 -> 991[label="",style="dashed", color="magenta", weight=3];
804[label="vuz30000",fontsize=16,color="green",shape="box"];805[label="primPlusNat (Succ vuz430) (Succ Zero)",fontsize=16,color="black",shape="box"];805 -> 862[label="",style="solid", color="black", weight=3];
806[label="primPlusNat Zero (Succ Zero)",fontsize=16,color="black",shape="box"];806 -> 863[label="",style="solid", color="black", weight=3];
1292[label="Integer (Pos vuz72) `quot` gcd0Gcd'2 (abs (Integer (Pos vuz73))) (abs (Integer (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];1292 -> 1298[label="",style="solid", color="black", weight=3];
1293[label="Integer (Pos vuz72) `quot` gcd1 (primEqInt (Pos (Succ vuz3100)) (Pos Zero)) (Integer (Pos vuz73)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1293 -> 1299[label="",style="solid", color="black", weight=3];
1296[label="Integer (Neg vuz81) `quot` gcd0Gcd'2 (abs (Integer (Neg vuz82))) (abs (Integer (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];1296 -> 1302[label="",style="solid", color="black", weight=3];
1297[label="Integer (Neg vuz81) `quot` gcd1 (primEqInt (Pos (Succ vuz3100)) (Pos Zero)) (Integer (Neg vuz82)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1297 -> 1303[label="",style="solid", color="black", weight=3];
1300[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'2 (abs (Integer (Neg vuz90))) (abs (Integer (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];1300 -> 1306[label="",style="solid", color="black", weight=3];
1301[label="Integer (Pos (Succ vuz3100)) `quot` gcd1 (primEqInt (Pos (Succ vuz3100)) (Pos Zero)) (Integer (Neg vuz90)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1301 -> 1307[label="",style="solid", color="black", weight=3];
1147 -> 749[label="",style="dashed", color="red", weight=0];
1147[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];1147 -> 1211[label="",style="dashed", color="magenta", weight=3];
1148[label="vuz3100",fontsize=16,color="green",shape="box"];1149 -> 749[label="",style="dashed", color="red", weight=0];
1149[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];1149 -> 1212[label="",style="dashed", color="magenta", weight=3];
1150 -> 749[label="",style="dashed", color="red", weight=0];
1150[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];1150 -> 1213[label="",style="dashed", color="magenta", weight=3];
984 -> 749[label="",style="dashed", color="red", weight=0];
984[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];984 -> 1096[label="",style="dashed", color="magenta", weight=3];
985 -> 749[label="",style="dashed", color="red", weight=0];
985[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];985 -> 1097[label="",style="dashed", color="magenta", weight=3];
986[label="vuz3100",fontsize=16,color="green",shape="box"];987 -> 749[label="",style="dashed", color="red", weight=0];
987[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];987 -> 1098[label="",style="dashed", color="magenta", weight=3];
1235 -> 749[label="",style="dashed", color="red", weight=0];
1235[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];1235 -> 1280[label="",style="dashed", color="magenta", weight=3];
1236[label="vuz3100",fontsize=16,color="green",shape="box"];1237 -> 749[label="",style="dashed", color="red", weight=0];
1237[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];1237 -> 1281[label="",style="dashed", color="magenta", weight=3];
988 -> 749[label="",style="dashed", color="red", weight=0];
988[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];988 -> 1099[label="",style="dashed", color="magenta", weight=3];
989[label="Succ vuz3100",fontsize=16,color="green",shape="box"];990[label="vuz3100",fontsize=16,color="green",shape="box"];991 -> 749[label="",style="dashed", color="red", weight=0];
991[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];991 -> 1100[label="",style="dashed", color="magenta", weight=3];
862[label="Succ (Succ (primPlusNat vuz430 Zero))",fontsize=16,color="green",shape="box"];862 -> 916[label="",style="dashed", color="green", weight=3];
863[label="Succ Zero",fontsize=16,color="green",shape="box"];1298[label="Integer (Pos vuz72) `quot` gcd0Gcd'1 (abs (Integer (Pos (Succ vuz3100))) == fromInt (Pos Zero)) (abs (Integer (Pos vuz73))) (abs (Integer (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];1298 -> 1304[label="",style="solid", color="black", weight=3];
1299[label="Integer (Pos vuz72) `quot` gcd1 False (Integer (Pos vuz73)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1299 -> 1305[label="",style="solid", color="black", weight=3];
1302[label="Integer (Neg vuz81) `quot` gcd0Gcd'1 (abs (Integer (Pos (Succ vuz3100))) == fromInt (Pos Zero)) (abs (Integer (Neg vuz82))) (abs (Integer (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];1302 -> 1308[label="",style="solid", color="black", weight=3];
1303[label="Integer (Neg vuz81) `quot` gcd1 False (Integer (Neg vuz82)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1303 -> 1309[label="",style="solid", color="black", weight=3];
1306[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (abs (Integer (Pos (Succ vuz3100))) == fromInt (Pos Zero)) (abs (Integer (Neg vuz90))) (abs (Integer (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];1306 -> 1311[label="",style="solid", color="black", weight=3];
1307[label="Integer (Pos (Succ vuz3100)) `quot` gcd1 False (Integer (Neg vuz90)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1307 -> 1312[label="",style="solid", color="black", weight=3];
1211[label="vuz300",fontsize=16,color="green",shape="box"];1212[label="vuz300",fontsize=16,color="green",shape="box"];1213[label="vuz300",fontsize=16,color="green",shape="box"];1096[label="vuz300",fontsize=16,color="green",shape="box"];1097[label="vuz300",fontsize=16,color="green",shape="box"];1098[label="vuz300",fontsize=16,color="green",shape="box"];1280[label="vuz300",fontsize=16,color="green",shape="box"];1281[label="vuz300",fontsize=16,color="green",shape="box"];1099[label="vuz300",fontsize=16,color="green",shape="box"];1100[label="vuz300",fontsize=16,color="green",shape="box"];916 -> 911[label="",style="dashed", color="red", weight=0];
916[label="primPlusNat vuz430 Zero",fontsize=16,color="magenta"];916 -> 1103[label="",style="dashed", color="magenta", weight=3];
1304[label="Integer (Pos vuz72) `quot` gcd0Gcd'1 (absReal (Integer (Pos (Succ vuz3100))) == fromInt (Pos Zero)) (abs (Integer (Pos vuz73))) (absReal (Integer (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];1304 -> 1310[label="",style="solid", color="black", weight=3];
1305 -> 1278[label="",style="dashed", color="red", weight=0];
1305[label="Integer (Pos vuz72) `quot` gcd0 (Integer (Pos vuz73)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="magenta"];1308[label="Integer (Neg vuz81) `quot` gcd0Gcd'1 (absReal (Integer (Pos (Succ vuz3100))) == fromInt (Pos Zero)) (abs (Integer (Neg vuz82))) (absReal (Integer (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];1308 -> 1313[label="",style="solid", color="black", weight=3];
1309 -> 1284[label="",style="dashed", color="red", weight=0];
1309[label="Integer (Neg vuz81) `quot` gcd0 (Integer (Neg vuz82)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="magenta"];1311[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal (Integer (Pos (Succ vuz3100))) == fromInt (Pos Zero)) (abs (Integer (Neg vuz90))) (absReal (Integer (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];1311 -> 1315[label="",style="solid", color="black", weight=3];
1312 -> 1288[label="",style="dashed", color="red", weight=0];
1312[label="Integer (Pos (Succ vuz3100)) `quot` gcd0 (Integer (Neg vuz90)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="magenta"];1103[label="vuz430",fontsize=16,color="green",shape="box"];911[label="primPlusNat vuz420 Zero",fontsize=16,color="burlywood",shape="triangle"];3566[label="vuz420/Succ vuz4200",fontsize=10,color="white",style="solid",shape="box"];911 -> 3566[label="",style="solid", color="burlywood", weight=9];
3566 -> 1101[label="",style="solid", color="burlywood", weight=3];
3567[label="vuz420/Zero",fontsize=10,color="white",style="solid",shape="box"];911 -> 3567[label="",style="solid", color="burlywood", weight=9];
3567 -> 1102[label="",style="solid", color="burlywood", weight=3];
1310[label="Integer (Pos vuz72) `quot` gcd0Gcd'1 (absReal2 (Integer (Pos (Succ vuz3100))) == fromInt (Pos Zero)) (abs (Integer (Pos vuz73))) (absReal2 (Integer (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];1310 -> 1314[label="",style="solid", color="black", weight=3];
1313[label="Integer (Neg vuz81) `quot` gcd0Gcd'1 (absReal2 (Integer (Pos (Succ vuz3100))) == fromInt (Pos Zero)) (abs (Integer (Neg vuz82))) (absReal2 (Integer (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];1313 -> 1316[label="",style="solid", color="black", weight=3];
1315[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal2 (Integer (Pos (Succ vuz3100))) == fromInt (Pos Zero)) (abs (Integer (Neg vuz90))) (absReal2 (Integer (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];1315 -> 1318[label="",style="solid", color="black", weight=3];
1101[label="primPlusNat (Succ vuz4200) Zero",fontsize=16,color="black",shape="box"];1101 -> 1214[label="",style="solid", color="black", weight=3];
1102[label="primPlusNat Zero Zero",fontsize=16,color="black",shape="box"];1102 -> 1215[label="",style="solid", color="black", weight=3];
1314[label="Integer (Pos vuz72) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) >= fromInt (Pos Zero)) == fromInt (Pos Zero)) (abs (Integer (Pos vuz73))) (absReal1 (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) >= fromInt (Pos Zero)))",fontsize=16,color="black",shape="box"];1314 -> 1317[label="",style="solid", color="black", weight=3];
1316[label="Integer (Neg vuz81) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) >= fromInt (Pos Zero)) == fromInt (Pos Zero)) (abs (Integer (Neg vuz82))) (absReal1 (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) >= fromInt (Pos Zero)))",fontsize=16,color="black",shape="box"];1316 -> 1319[label="",style="solid", color="black", weight=3];
1318[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) >= fromInt (Pos Zero)) == fromInt (Pos Zero)) (abs (Integer (Neg vuz90))) (absReal1 (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) >= fromInt (Pos Zero)))",fontsize=16,color="black",shape="box"];1318 -> 1321[label="",style="solid", color="black", weight=3];
1214[label="Succ vuz4200",fontsize=16,color="green",shape="box"];1215[label="Zero",fontsize=16,color="green",shape="box"];1317[label="Integer (Pos vuz72) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (compare (Integer (Pos (Succ vuz3100))) (fromInt (Pos Zero)) /= LT) == fromInt (Pos Zero)) (abs (Integer (Pos vuz73))) (absReal1 (Integer (Pos (Succ vuz3100))) (compare (Integer (Pos (Succ vuz3100))) (fromInt (Pos Zero)) /= LT))",fontsize=16,color="black",shape="box"];1317 -> 1320[label="",style="solid", color="black", weight=3];
1319[label="Integer (Neg vuz81) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (compare (Integer (Pos (Succ vuz3100))) (fromInt (Pos Zero)) /= LT) == fromInt (Pos Zero)) (abs (Integer (Neg vuz82))) (absReal1 (Integer (Pos (Succ vuz3100))) (compare (Integer (Pos (Succ vuz3100))) (fromInt (Pos Zero)) /= LT))",fontsize=16,color="black",shape="box"];1319 -> 1322[label="",style="solid", color="black", weight=3];
1321[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (compare (Integer (Pos (Succ vuz3100))) (fromInt (Pos Zero)) /= LT) == fromInt (Pos Zero)) (abs (Integer (Neg vuz90))) (absReal1 (Integer (Pos (Succ vuz3100))) (compare (Integer (Pos (Succ vuz3100))) (fromInt (Pos Zero)) /= LT))",fontsize=16,color="black",shape="box"];1321 -> 1324[label="",style="solid", color="black", weight=3];
1320[label="Integer (Pos vuz72) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (not (compare (Integer (Pos (Succ vuz3100))) (fromInt (Pos Zero)) == LT)) == fromInt (Pos Zero)) (abs (Integer (Pos vuz73))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (compare (Integer (Pos (Succ vuz3100))) (fromInt (Pos Zero)) == LT)))",fontsize=16,color="black",shape="box"];1320 -> 1323[label="",style="solid", color="black", weight=3];
1322[label="Integer (Neg vuz81) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (not (compare (Integer (Pos (Succ vuz3100))) (fromInt (Pos Zero)) == LT)) == fromInt (Pos Zero)) (abs (Integer (Neg vuz82))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (compare (Integer (Pos (Succ vuz3100))) (fromInt (Pos Zero)) == LT)))",fontsize=16,color="black",shape="box"];1322 -> 1325[label="",style="solid", color="black", weight=3];
1324[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (not (compare (Integer (Pos (Succ vuz3100))) (fromInt (Pos Zero)) == LT)) == fromInt (Pos Zero)) (abs (Integer (Neg vuz90))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (compare (Integer (Pos (Succ vuz3100))) (fromInt (Pos Zero)) == LT)))",fontsize=16,color="black",shape="box"];1324 -> 1327[label="",style="solid", color="black", weight=3];
1323[label="Integer (Pos vuz72) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (not (compare (Integer (Pos (Succ vuz3100))) (Integer (Pos Zero)) == LT)) == fromInt (Pos Zero)) (abs (Integer (Pos vuz73))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (compare (Integer (Pos (Succ vuz3100))) (Integer (Pos Zero)) == LT)))",fontsize=16,color="black",shape="box"];1323 -> 1326[label="",style="solid", color="black", weight=3];
1325[label="Integer (Neg vuz81) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (not (compare (Integer (Pos (Succ vuz3100))) (Integer (Pos Zero)) == LT)) == fromInt (Pos Zero)) (abs (Integer (Neg vuz82))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (compare (Integer (Pos (Succ vuz3100))) (Integer (Pos Zero)) == LT)))",fontsize=16,color="black",shape="box"];1325 -> 1328[label="",style="solid", color="black", weight=3];
1327[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (not (compare (Integer (Pos (Succ vuz3100))) (Integer (Pos Zero)) == LT)) == fromInt (Pos Zero)) (abs (Integer (Neg vuz90))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (compare (Integer (Pos (Succ vuz3100))) (Integer (Pos Zero)) == LT)))",fontsize=16,color="black",shape="box"];1327 -> 1330[label="",style="solid", color="black", weight=3];
1326[label="Integer (Pos vuz72) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (not (primCmpInt (Pos (Succ vuz3100)) (Pos Zero) == LT)) == fromInt (Pos Zero)) (abs (Integer (Pos vuz73))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (primCmpInt (Pos (Succ vuz3100)) (Pos Zero) == LT)))",fontsize=16,color="black",shape="box"];1326 -> 1329[label="",style="solid", color="black", weight=3];
1328[label="Integer (Neg vuz81) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (not (primCmpInt (Pos (Succ vuz3100)) (Pos Zero) == LT)) == fromInt (Pos Zero)) (abs (Integer (Neg vuz82))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (primCmpInt (Pos (Succ vuz3100)) (Pos Zero) == LT)))",fontsize=16,color="black",shape="box"];1328 -> 1331[label="",style="solid", color="black", weight=3];
1330[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (not (primCmpInt (Pos (Succ vuz3100)) (Pos Zero) == LT)) == fromInt (Pos Zero)) (abs (Integer (Neg vuz90))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (primCmpInt (Pos (Succ vuz3100)) (Pos Zero) == LT)))",fontsize=16,color="black",shape="box"];1330 -> 1333[label="",style="solid", color="black", weight=3];
1329[label="Integer (Pos vuz72) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (not (primCmpNat (Succ vuz3100) Zero == LT)) == fromInt (Pos Zero)) (abs (Integer (Pos vuz73))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (primCmpNat (Succ vuz3100) Zero == LT)))",fontsize=16,color="black",shape="box"];1329 -> 1332[label="",style="solid", color="black", weight=3];
1331[label="Integer (Neg vuz81) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (not (primCmpNat (Succ vuz3100) Zero == LT)) == fromInt (Pos Zero)) (abs (Integer (Neg vuz82))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (primCmpNat (Succ vuz3100) Zero == LT)))",fontsize=16,color="black",shape="box"];1331 -> 1334[label="",style="solid", color="black", weight=3];
1333[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (not (primCmpNat (Succ vuz3100) Zero == LT)) == fromInt (Pos Zero)) (abs (Integer (Neg vuz90))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (primCmpNat (Succ vuz3100) Zero == LT)))",fontsize=16,color="black",shape="box"];1333 -> 1336[label="",style="solid", color="black", weight=3];
1332[label="Integer (Pos vuz72) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (not (GT == LT)) == fromInt (Pos Zero)) (abs (Integer (Pos vuz73))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (GT == LT)))",fontsize=16,color="black",shape="box"];1332 -> 1335[label="",style="solid", color="black", weight=3];
1334[label="Integer (Neg vuz81) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (not (GT == LT)) == fromInt (Pos Zero)) (abs (Integer (Neg vuz82))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (GT == LT)))",fontsize=16,color="black",shape="box"];1334 -> 1337[label="",style="solid", color="black", weight=3];
1336[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (not (GT == LT)) == fromInt (Pos Zero)) (abs (Integer (Neg vuz90))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (GT == LT)))",fontsize=16,color="black",shape="box"];1336 -> 1339[label="",style="solid", color="black", weight=3];
1335[label="Integer (Pos vuz72) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (not False) == fromInt (Pos Zero)) (abs (Integer (Pos vuz73))) (absReal1 (Integer (Pos (Succ vuz3100))) (not False))",fontsize=16,color="black",shape="box"];1335 -> 1338[label="",style="solid", color="black", weight=3];
1337[label="Integer (Neg vuz81) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (not False) == fromInt (Pos Zero)) (abs (Integer (Neg vuz82))) (absReal1 (Integer (Pos (Succ vuz3100))) (not False))",fontsize=16,color="black",shape="box"];1337 -> 1340[label="",style="solid", color="black", weight=3];
1339[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (not False) == fromInt (Pos Zero)) (abs (Integer (Neg vuz90))) (absReal1 (Integer (Pos (Succ vuz3100))) (not False))",fontsize=16,color="black",shape="box"];1339 -> 1342[label="",style="solid", color="black", weight=3];
1338[label="Integer (Pos vuz72) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) True == fromInt (Pos Zero)) (abs (Integer (Pos vuz73))) (absReal1 (Integer (Pos (Succ vuz3100))) True)",fontsize=16,color="black",shape="box"];1338 -> 1341[label="",style="solid", color="black", weight=3];
1340[label="Integer (Neg vuz81) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) True == fromInt (Pos Zero)) (abs (Integer (Neg vuz82))) (absReal1 (Integer (Pos (Succ vuz3100))) True)",fontsize=16,color="black",shape="box"];1340 -> 1343[label="",style="solid", color="black", weight=3];
1342[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) True == fromInt (Pos Zero)) (abs (Integer (Neg vuz90))) (absReal1 (Integer (Pos (Succ vuz3100))) True)",fontsize=16,color="black",shape="box"];1342 -> 1345[label="",style="solid", color="black", weight=3];
1341[label="Integer (Pos vuz72) `quot` gcd0Gcd'1 (Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (abs (Integer (Pos vuz73))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1341 -> 1344[label="",style="solid", color="black", weight=3];
1343[label="Integer (Neg vuz81) `quot` gcd0Gcd'1 (Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (abs (Integer (Neg vuz82))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1343 -> 1346[label="",style="solid", color="black", weight=3];
1345[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (abs (Integer (Neg vuz90))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1345 -> 1348[label="",style="solid", color="black", weight=3];
1344[label="Integer (Pos vuz72) `quot` gcd0Gcd'1 (Integer (Pos (Succ vuz3100)) == Integer (Pos Zero)) (abs (Integer (Pos vuz73))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1344 -> 1347[label="",style="solid", color="black", weight=3];
1346[label="Integer (Neg vuz81) `quot` gcd0Gcd'1 (Integer (Pos (Succ vuz3100)) == Integer (Pos Zero)) (abs (Integer (Neg vuz82))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1346 -> 1349[label="",style="solid", color="black", weight=3];
1348[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (Integer (Pos (Succ vuz3100)) == Integer (Pos Zero)) (abs (Integer (Neg vuz90))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1348 -> 1351[label="",style="solid", color="black", weight=3];
1347[label="Integer (Pos vuz72) `quot` gcd0Gcd'1 (primEqInt (Pos (Succ vuz3100)) (Pos Zero)) (abs (Integer (Pos vuz73))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1347 -> 1350[label="",style="solid", color="black", weight=3];
1349[label="Integer (Neg vuz81) `quot` gcd0Gcd'1 (primEqInt (Pos (Succ vuz3100)) (Pos Zero)) (abs (Integer (Neg vuz82))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1349 -> 1352[label="",style="solid", color="black", weight=3];
1351[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (primEqInt (Pos (Succ vuz3100)) (Pos Zero)) (abs (Integer (Neg vuz90))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1351 -> 1354[label="",style="solid", color="black", weight=3];
1350[label="Integer (Pos vuz72) `quot` gcd0Gcd'1 False (abs (Integer (Pos vuz73))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1350 -> 1353[label="",style="solid", color="black", weight=3];
1352[label="Integer (Neg vuz81) `quot` gcd0Gcd'1 False (abs (Integer (Neg vuz82))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1352 -> 1355[label="",style="solid", color="black", weight=3];
1354[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 False (abs (Integer (Neg vuz90))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1354 -> 1357[label="",style="solid", color="black", weight=3];
1353[label="Integer (Pos vuz72) `quot` gcd0Gcd'0 (abs (Integer (Pos vuz73))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1353 -> 1356[label="",style="solid", color="black", weight=3];
1355[label="Integer (Neg vuz81) `quot` gcd0Gcd'0 (abs (Integer (Neg vuz82))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1355 -> 1358[label="",style="solid", color="black", weight=3];
1357[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'0 (abs (Integer (Neg vuz90))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1357 -> 1360[label="",style="solid", color="black", weight=3];
1356[label="Integer (Pos vuz72) `quot` gcd0Gcd' (Integer (Pos (Succ vuz3100))) (abs (Integer (Pos vuz73)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1356 -> 1359[label="",style="solid", color="black", weight=3];
1358[label="Integer (Neg vuz81) `quot` gcd0Gcd' (Integer (Pos (Succ vuz3100))) (abs (Integer (Neg vuz82)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1358 -> 1361[label="",style="solid", color="black", weight=3];
1360[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd' (Integer (Pos (Succ vuz3100))) (abs (Integer (Neg vuz90)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1360 -> 1363[label="",style="solid", color="black", weight=3];
1359[label="Integer (Pos vuz72) `quot` gcd0Gcd'2 (Integer (Pos (Succ vuz3100))) (abs (Integer (Pos vuz73)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1359 -> 1362[label="",style="solid", color="black", weight=3];
1361[label="Integer (Neg vuz81) `quot` gcd0Gcd'2 (Integer (Pos (Succ vuz3100))) (abs (Integer (Neg vuz82)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1361 -> 1364[label="",style="solid", color="black", weight=3];
1363[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'2 (Integer (Pos (Succ vuz3100))) (abs (Integer (Neg vuz90)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1363 -> 1366[label="",style="solid", color="black", weight=3];
1362[label="Integer (Pos vuz72) `quot` gcd0Gcd'1 (abs (Integer (Pos vuz73)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (abs (Integer (Pos vuz73)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1362 -> 1365[label="",style="solid", color="black", weight=3];
1364[label="Integer (Neg vuz81) `quot` gcd0Gcd'1 (abs (Integer (Neg vuz82)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (abs (Integer (Neg vuz82)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1364 -> 1367[label="",style="solid", color="black", weight=3];
1366[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (abs (Integer (Neg vuz90)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (abs (Integer (Neg vuz90)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1366 -> 1369[label="",style="solid", color="black", weight=3];
1365[label="Integer (Pos vuz72) `quot` gcd0Gcd'1 (absReal (Integer (Pos vuz73)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal (Integer (Pos vuz73)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1365 -> 1368[label="",style="solid", color="black", weight=3];
1367[label="Integer (Neg vuz81) `quot` gcd0Gcd'1 (absReal (Integer (Neg vuz82)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal (Integer (Neg vuz82)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1367 -> 1370[label="",style="solid", color="black", weight=3];
1369[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal (Integer (Neg vuz90)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal (Integer (Neg vuz90)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1369 -> 1372[label="",style="solid", color="black", weight=3];
1368[label="Integer (Pos vuz72) `quot` gcd0Gcd'1 (absReal2 (Integer (Pos vuz73)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal2 (Integer (Pos vuz73)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1368 -> 1371[label="",style="solid", color="black", weight=3];
1370[label="Integer (Neg vuz81) `quot` gcd0Gcd'1 (absReal2 (Integer (Neg vuz82)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal2 (Integer (Neg vuz82)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1370 -> 1373[label="",style="solid", color="black", weight=3];
1372[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal2 (Integer (Neg vuz90)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal2 (Integer (Neg vuz90)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1372 -> 1375[label="",style="solid", color="black", weight=3];
1371[label="Integer (Pos vuz72) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos vuz73)) (Integer (Pos vuz73) >= fromInt (Pos Zero)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Pos vuz73)) (Integer (Pos vuz73) >= fromInt (Pos Zero)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1371 -> 1374[label="",style="solid", color="black", weight=3];
1373[label="Integer (Neg vuz81) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg vuz82)) (Integer (Neg vuz82) >= fromInt (Pos Zero)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg vuz82)) (Integer (Neg vuz82) >= fromInt (Pos Zero)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1373 -> 1376[label="",style="solid", color="black", weight=3];
1375[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg vuz90)) (Integer (Neg vuz90) >= fromInt (Pos Zero)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg vuz90)) (Integer (Neg vuz90) >= fromInt (Pos Zero)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1375 -> 1378[label="",style="solid", color="black", weight=3];
1374[label="Integer (Pos vuz72) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos vuz73)) (compare (Integer (Pos vuz73)) (fromInt (Pos Zero)) /= LT) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Pos vuz73)) (compare (Integer (Pos vuz73)) (fromInt (Pos Zero)) /= LT) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1374 -> 1377[label="",style="solid", color="black", weight=3];
1376[label="Integer (Neg vuz81) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg vuz82)) (compare (Integer (Neg vuz82)) (fromInt (Pos Zero)) /= LT) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg vuz82)) (compare (Integer (Neg vuz82)) (fromInt (Pos Zero)) /= LT) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1376 -> 1379[label="",style="solid", color="black", weight=3];
1378[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg vuz90)) (compare (Integer (Neg vuz90)) (fromInt (Pos Zero)) /= LT) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg vuz90)) (compare (Integer (Neg vuz90)) (fromInt (Pos Zero)) /= LT) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1378 -> 1381[label="",style="solid", color="black", weight=3];
1377[label="Integer (Pos vuz72) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos vuz73)) (not (compare (Integer (Pos vuz73)) (fromInt (Pos Zero)) == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Pos vuz73)) (not (compare (Integer (Pos vuz73)) (fromInt (Pos Zero)) == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1377 -> 1380[label="",style="solid", color="black", weight=3];
1379[label="Integer (Neg vuz81) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg vuz82)) (not (compare (Integer (Neg vuz82)) (fromInt (Pos Zero)) == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg vuz82)) (not (compare (Integer (Neg vuz82)) (fromInt (Pos Zero)) == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1379 -> 1382[label="",style="solid", color="black", weight=3];
1381[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg vuz90)) (not (compare (Integer (Neg vuz90)) (fromInt (Pos Zero)) == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg vuz90)) (not (compare (Integer (Neg vuz90)) (fromInt (Pos Zero)) == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1381 -> 1384[label="",style="solid", color="black", weight=3];
1380[label="Integer (Pos vuz72) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos vuz73)) (not (compare (Integer (Pos vuz73)) (Integer (Pos Zero)) == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Pos vuz73)) (not (compare (Integer (Pos vuz73)) (Integer (Pos Zero)) == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1380 -> 1383[label="",style="solid", color="black", weight=3];
1382[label="Integer (Neg vuz81) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg vuz82)) (not (compare (Integer (Neg vuz82)) (Integer (Pos Zero)) == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg vuz82)) (not (compare (Integer (Neg vuz82)) (Integer (Pos Zero)) == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1382 -> 1385[label="",style="solid", color="black", weight=3];
1384[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg vuz90)) (not (compare (Integer (Neg vuz90)) (Integer (Pos Zero)) == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg vuz90)) (not (compare (Integer (Neg vuz90)) (Integer (Pos Zero)) == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1384 -> 1388[label="",style="solid", color="black", weight=3];
1383[label="Integer (Pos vuz72) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos vuz73)) (not (primCmpInt (Pos vuz73) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Pos vuz73)) (not (primCmpInt (Pos vuz73) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="burlywood",shape="box"];3568[label="vuz73/Succ vuz730",fontsize=10,color="white",style="solid",shape="box"];1383 -> 3568[label="",style="solid", color="burlywood", weight=9];
3568 -> 1386[label="",style="solid", color="burlywood", weight=3];
3569[label="vuz73/Zero",fontsize=10,color="white",style="solid",shape="box"];1383 -> 3569[label="",style="solid", color="burlywood", weight=9];
3569 -> 1387[label="",style="solid", color="burlywood", weight=3];
1385[label="Integer (Neg vuz81) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg vuz82)) (not (primCmpInt (Neg vuz82) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg vuz82)) (not (primCmpInt (Neg vuz82) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="burlywood",shape="box"];3570[label="vuz82/Succ vuz820",fontsize=10,color="white",style="solid",shape="box"];1385 -> 3570[label="",style="solid", color="burlywood", weight=9];
3570 -> 1389[label="",style="solid", color="burlywood", weight=3];
3571[label="vuz82/Zero",fontsize=10,color="white",style="solid",shape="box"];1385 -> 3571[label="",style="solid", color="burlywood", weight=9];
3571 -> 1390[label="",style="solid", color="burlywood", weight=3];
1388[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg vuz90)) (not (primCmpInt (Neg vuz90) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg vuz90)) (not (primCmpInt (Neg vuz90) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="burlywood",shape="box"];3572[label="vuz90/Succ vuz900",fontsize=10,color="white",style="solid",shape="box"];1388 -> 3572[label="",style="solid", color="burlywood", weight=9];
3572 -> 1393[label="",style="solid", color="burlywood", weight=3];
3573[label="vuz90/Zero",fontsize=10,color="white",style="solid",shape="box"];1388 -> 3573[label="",style="solid", color="burlywood", weight=9];
3573 -> 1394[label="",style="solid", color="burlywood", weight=3];
1386[label="Integer (Pos vuz72) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz730))) (not (primCmpInt (Pos (Succ vuz730)) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Pos (Succ vuz730))) (not (primCmpInt (Pos (Succ vuz730)) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1386 -> 1391[label="",style="solid", color="black", weight=3];
1387[label="Integer (Pos vuz72) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos Zero)) (not (primCmpInt (Pos Zero) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Pos Zero)) (not (primCmpInt (Pos Zero) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1387 -> 1392[label="",style="solid", color="black", weight=3];
1389[label="Integer (Neg vuz81) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg (Succ vuz820))) (not (primCmpInt (Neg (Succ vuz820)) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg (Succ vuz820))) (not (primCmpInt (Neg (Succ vuz820)) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1389 -> 1395[label="",style="solid", color="black", weight=3];
1390[label="Integer (Neg vuz81) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg Zero)) (not (primCmpInt (Neg Zero) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg Zero)) (not (primCmpInt (Neg Zero) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1390 -> 1396[label="",style="solid", color="black", weight=3];
1393[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg (Succ vuz900))) (not (primCmpInt (Neg (Succ vuz900)) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg (Succ vuz900))) (not (primCmpInt (Neg (Succ vuz900)) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1393 -> 1399[label="",style="solid", color="black", weight=3];
1394[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg Zero)) (not (primCmpInt (Neg Zero) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg Zero)) (not (primCmpInt (Neg Zero) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1394 -> 1400[label="",style="solid", color="black", weight=3];
1391[label="Integer (Pos vuz72) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz730))) (not (primCmpNat (Succ vuz730) Zero == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Pos (Succ vuz730))) (not (primCmpNat (Succ vuz730) Zero == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1391 -> 1397[label="",style="solid", color="black", weight=3];
1392[label="Integer (Pos vuz72) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos Zero)) (not (EQ == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Pos Zero)) (not (EQ == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1392 -> 1398[label="",style="solid", color="black", weight=3];
1395[label="Integer (Neg vuz81) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg (Succ vuz820))) (not (LT == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg (Succ vuz820))) (not (LT == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1395 -> 1401[label="",style="solid", color="black", weight=3];
1396[label="Integer (Neg vuz81) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg Zero)) (not (EQ == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg Zero)) (not (EQ == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1396 -> 1402[label="",style="solid", color="black", weight=3];
1399[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg (Succ vuz900))) (not (LT == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg (Succ vuz900))) (not (LT == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1399 -> 1405[label="",style="solid", color="black", weight=3];
1400[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg Zero)) (not (EQ == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg Zero)) (not (EQ == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1400 -> 1406[label="",style="solid", color="black", weight=3];
1397[label="Integer (Pos vuz72) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz730))) (not (GT == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Pos (Succ vuz730))) (not (GT == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1397 -> 1403[label="",style="solid", color="black", weight=3];
1398[label="Integer (Pos vuz72) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos Zero)) (not False) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Pos Zero)) (not False) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1398 -> 1404[label="",style="solid", color="black", weight=3];
1401[label="Integer (Neg vuz81) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg (Succ vuz820))) (not True) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg (Succ vuz820))) (not True) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1401 -> 1407[label="",style="solid", color="black", weight=3];
1402[label="Integer (Neg vuz81) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg Zero)) (not False) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg Zero)) (not False) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1402 -> 1408[label="",style="solid", color="black", weight=3];
1405[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg (Succ vuz900))) (not True) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg (Succ vuz900))) (not True) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1405 -> 1411[label="",style="solid", color="black", weight=3];
1406[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg Zero)) (not False) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg Zero)) (not False) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1406 -> 1412[label="",style="solid", color="black", weight=3];
1403[label="Integer (Pos vuz72) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz730))) (not False) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Pos (Succ vuz730))) (not False) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1403 -> 1409[label="",style="solid", color="black", weight=3];
1404[label="Integer (Pos vuz72) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos Zero)) True `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Pos Zero)) True `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1404 -> 1410[label="",style="solid", color="black", weight=3];
1407[label="Integer (Neg vuz81) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg (Succ vuz820))) False `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg (Succ vuz820))) False `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1407 -> 1413[label="",style="solid", color="black", weight=3];
1408[label="Integer (Neg vuz81) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg Zero)) True `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg Zero)) True `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1408 -> 1414[label="",style="solid", color="black", weight=3];
1411[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg (Succ vuz900))) False `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg (Succ vuz900))) False `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1411 -> 1417[label="",style="solid", color="black", weight=3];
1412[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg Zero)) True `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg Zero)) True `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1412 -> 1418[label="",style="solid", color="black", weight=3];
1409[label="Integer (Pos vuz72) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz730))) True `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Pos (Succ vuz730))) True `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1409 -> 1415[label="",style="solid", color="black", weight=3];
1410[label="Integer (Pos vuz72) `quot` gcd0Gcd'1 (Integer (Pos Zero) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (Pos Zero) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1410 -> 1416[label="",style="solid", color="black", weight=3];
1413[label="Integer (Neg vuz81) `quot` gcd0Gcd'1 (absReal0 (Integer (Neg (Succ vuz820))) otherwise `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal0 (Integer (Neg (Succ vuz820))) otherwise `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1413 -> 1419[label="",style="solid", color="black", weight=3];
1414[label="Integer (Neg vuz81) `quot` gcd0Gcd'1 (Integer (Neg Zero) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (Neg Zero) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1414 -> 1420[label="",style="solid", color="black", weight=3];
1417[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal0 (Integer (Neg (Succ vuz900))) otherwise `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal0 (Integer (Neg (Succ vuz900))) otherwise `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1417 -> 1423[label="",style="solid", color="black", weight=3];
1418[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (Integer (Neg Zero) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (Neg Zero) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1418 -> 1424[label="",style="solid", color="black", weight=3];
1415[label="Integer (Pos vuz72) `quot` gcd0Gcd'1 (Integer (Pos (Succ vuz730)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz730)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="triangle"];1415 -> 1421[label="",style="solid", color="black", weight=3];
1416[label="Integer (Pos vuz72) `quot` gcd0Gcd'1 (Integer (primRemInt (Pos Zero) (Pos (Succ vuz3100))) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (primRemInt (Pos Zero) (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];1416 -> 1422[label="",style="solid", color="black", weight=3];
1419[label="Integer (Neg vuz81) `quot` gcd0Gcd'1 (absReal0 (Integer (Neg (Succ vuz820))) True `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal0 (Integer (Neg (Succ vuz820))) True `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1419 -> 1425[label="",style="solid", color="black", weight=3];
1420[label="Integer (Neg vuz81) `quot` gcd0Gcd'1 (Integer (primRemInt (Neg Zero) (Pos (Succ vuz3100))) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (primRemInt (Neg Zero) (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];1420 -> 1426[label="",style="solid", color="black", weight=3];
1423[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal0 (Integer (Neg (Succ vuz900))) True `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal0 (Integer (Neg (Succ vuz900))) True `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1423 -> 1429[label="",style="solid", color="black", weight=3];
1424[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (Integer (primRemInt (Neg Zero) (Pos (Succ vuz3100))) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (primRemInt (Neg Zero) (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];1424 -> 1430[label="",style="solid", color="black", weight=3];
1421[label="Integer (Pos vuz72) `quot` gcd0Gcd'1 (Integer (primRemInt (Pos (Succ vuz730)) (Pos (Succ vuz3100))) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (primRemInt (Pos (Succ vuz730)) (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];1421 -> 1427[label="",style="solid", color="black", weight=3];
1422[label="Integer (Pos vuz72) `quot` gcd0Gcd'1 (Integer (primRemInt (Pos Zero) (Pos (Succ vuz3100))) == Integer (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (primRemInt (Pos Zero) (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];1422 -> 1428[label="",style="solid", color="black", weight=3];
1425[label="Integer (Neg vuz81) `quot` gcd0Gcd'1 ((`negate` Integer (Neg (Succ vuz820))) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) ((`negate` Integer (Neg (Succ vuz820))) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1425 -> 1431[label="",style="solid", color="black", weight=3];
1426[label="Integer (Neg vuz81) `quot` gcd0Gcd'1 (Integer (primRemInt (Neg Zero) (Pos (Succ vuz3100))) == Integer (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (primRemInt (Neg Zero) (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];1426 -> 1432[label="",style="solid", color="black", weight=3];
1429[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 ((`negate` Integer (Neg (Succ vuz900))) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) ((`negate` Integer (Neg (Succ vuz900))) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1429 -> 1435[label="",style="solid", color="black", weight=3];
1430[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (Integer (primRemInt (Neg Zero) (Pos (Succ vuz3100))) == Integer (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (primRemInt (Neg Zero) (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];1430 -> 1436[label="",style="solid", color="black", weight=3];
1427[label="Integer (Pos vuz72) `quot` gcd0Gcd'1 (Integer (primRemInt (Pos (Succ vuz730)) (Pos (Succ vuz3100))) == Integer (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (primRemInt (Pos (Succ vuz730)) (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];1427 -> 1433[label="",style="solid", color="black", weight=3];
1428[label="Integer (Pos vuz72) `quot` gcd0Gcd'1 (primEqInt (primRemInt (Pos Zero) (Pos (Succ vuz3100))) (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (primRemInt (Pos Zero) (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];1428 -> 1434[label="",style="solid", color="black", weight=3];
1431[label="Integer (Neg vuz81) `quot` gcd0Gcd'1 (Integer (primNegInt (Neg (Succ vuz820))) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (primNegInt (Neg (Succ vuz820))) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1431 -> 1437[label="",style="solid", color="black", weight=3];
1432[label="Integer (Neg vuz81) `quot` gcd0Gcd'1 (primEqInt (primRemInt (Neg Zero) (Pos (Succ vuz3100))) (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (primRemInt (Neg Zero) (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];1432 -> 1438[label="",style="solid", color="black", weight=3];
1435[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (Integer (primNegInt (Neg (Succ vuz900))) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (primNegInt (Neg (Succ vuz900))) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1435 -> 1441[label="",style="solid", color="black", weight=3];
1436[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (primEqInt (primRemInt (Neg Zero) (Pos (Succ vuz3100))) (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (primRemInt (Neg Zero) (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];1436 -> 1442[label="",style="solid", color="black", weight=3];
1433[label="Integer (Pos vuz72) `quot` gcd0Gcd'1 (primEqInt (primRemInt (Pos (Succ vuz730)) (Pos (Succ vuz3100))) (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (primRemInt (Pos (Succ vuz730)) (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="triangle"];1433 -> 1439[label="",style="solid", color="black", weight=3];
1434 -> 2454[label="",style="dashed", color="red", weight=0];
1434[label="Integer (Pos vuz72) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS Zero (Succ vuz3100))) (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (Pos (primModNatS Zero (Succ vuz3100))))",fontsize=16,color="magenta"];1434 -> 2455[label="",style="dashed", color="magenta", weight=3];
1434 -> 2456[label="",style="dashed", color="magenta", weight=3];
1434 -> 2457[label="",style="dashed", color="magenta", weight=3];
1434 -> 2458[label="",style="dashed", color="magenta", weight=3];
1437[label="Integer (Neg vuz81) `quot` gcd0Gcd'1 (Integer (primRemInt (primNegInt (Neg (Succ vuz820))) (Pos (Succ vuz3100))) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (primRemInt (primNegInt (Neg (Succ vuz820))) (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];1437 -> 1443[label="",style="solid", color="black", weight=3];
1438[label="Integer (Neg vuz81) `quot` gcd0Gcd'1 (primEqInt (Neg (primModNatS Zero (Succ vuz3100))) (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (Neg (primModNatS Zero (Succ vuz3100))))",fontsize=16,color="black",shape="box"];1438 -> 1444[label="",style="solid", color="black", weight=3];
1441[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (Integer (primRemInt (primNegInt (Neg (Succ vuz900))) (Pos (Succ vuz3100))) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (primRemInt (primNegInt (Neg (Succ vuz900))) (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];1441 -> 1447[label="",style="solid", color="black", weight=3];
1442[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (primEqInt (Neg (primModNatS Zero (Succ vuz3100))) (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (Neg (primModNatS Zero (Succ vuz3100))))",fontsize=16,color="black",shape="box"];1442 -> 1448[label="",style="solid", color="black", weight=3];
1439 -> 2454[label="",style="dashed", color="red", weight=0];
1439[label="Integer (Pos vuz72) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (Succ vuz730) (Succ vuz3100))) (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (Pos (primModNatS (Succ vuz730) (Succ vuz3100))))",fontsize=16,color="magenta"];1439 -> 2459[label="",style="dashed", color="magenta", weight=3];
1439 -> 2460[label="",style="dashed", color="magenta", weight=3];
1439 -> 2461[label="",style="dashed", color="magenta", weight=3];
1439 -> 2462[label="",style="dashed", color="magenta", weight=3];
2455[label="vuz72",fontsize=16,color="green",shape="box"];2456[label="Zero",fontsize=16,color="green",shape="box"];2457[label="vuz3100",fontsize=16,color="green",shape="box"];2458[label="Zero",fontsize=16,color="green",shape="box"];2454[label="Integer (Pos vuz149) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS vuz161 (Succ vuz151))) (Pos Zero)) (Integer (Pos (Succ vuz151))) (Integer (Pos (primModNatS vuz160 (Succ vuz151))))",fontsize=16,color="burlywood",shape="triangle"];3576[label="vuz161/Succ vuz1610",fontsize=10,color="white",style="solid",shape="box"];2454 -> 3576[label="",style="solid", color="burlywood", weight=9];
3576 -> 2481[label="",style="solid", color="burlywood", weight=3];
3577[label="vuz161/Zero",fontsize=10,color="white",style="solid",shape="box"];2454 -> 3577[label="",style="solid", color="burlywood", weight=9];
3577 -> 2482[label="",style="solid", color="burlywood", weight=3];
1443[label="Integer (Neg vuz81) `quot` gcd0Gcd'1 (Integer (primRemInt (primNegInt (Neg (Succ vuz820))) (Pos (Succ vuz3100))) == Integer (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (primRemInt (primNegInt (Neg (Succ vuz820))) (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];1443 -> 1449[label="",style="solid", color="black", weight=3];
1444[label="Integer (Neg vuz81) `quot` gcd0Gcd'1 (primEqInt (Neg Zero) (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (Neg Zero))",fontsize=16,color="black",shape="box"];1444 -> 1450[label="",style="solid", color="black", weight=3];
1447[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (Integer (primRemInt (primNegInt (Neg (Succ vuz900))) (Pos (Succ vuz3100))) == Integer (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (primRemInt (primNegInt (Neg (Succ vuz900))) (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];1447 -> 1454[label="",style="solid", color="black", weight=3];
1448[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (primEqInt (Neg Zero) (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (Neg Zero))",fontsize=16,color="black",shape="box"];1448 -> 1455[label="",style="solid", color="black", weight=3];
2459[label="vuz72",fontsize=16,color="green",shape="box"];2460[label="Succ vuz730",fontsize=16,color="green",shape="box"];2461[label="vuz3100",fontsize=16,color="green",shape="box"];2462[label="Succ vuz730",fontsize=16,color="green",shape="box"];2481[label="Integer (Pos vuz149) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (Succ vuz1610) (Succ vuz151))) (Pos Zero)) (Integer (Pos (Succ vuz151))) (Integer (Pos (primModNatS vuz160 (Succ vuz151))))",fontsize=16,color="black",shape="box"];2481 -> 2498[label="",style="solid", color="black", weight=3];
2482[label="Integer (Pos vuz149) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS Zero (Succ vuz151))) (Pos Zero)) (Integer (Pos (Succ vuz151))) (Integer (Pos (primModNatS vuz160 (Succ vuz151))))",fontsize=16,color="black",shape="box"];2482 -> 2499[label="",style="solid", color="black", weight=3];
1449[label="Integer (Neg vuz81) `quot` gcd0Gcd'1 (primEqInt (primRemInt (primNegInt (Neg (Succ vuz820))) (Pos (Succ vuz3100))) (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (primRemInt (primNegInt (Neg (Succ vuz820))) (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];1449 -> 1456[label="",style="solid", color="black", weight=3];
1450[label="Integer (Neg vuz81) `quot` gcd0Gcd'1 True (Integer (Pos (Succ vuz3100))) (Integer (Neg Zero))",fontsize=16,color="black",shape="box"];1450 -> 1457[label="",style="solid", color="black", weight=3];
1454[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (primEqInt (primRemInt (primNegInt (Neg (Succ vuz900))) (Pos (Succ vuz3100))) (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (primRemInt (primNegInt (Neg (Succ vuz900))) (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];1454 -> 1463[label="",style="solid", color="black", weight=3];
1455[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 True (Integer (Pos (Succ vuz3100))) (Integer (Neg Zero))",fontsize=16,color="black",shape="box"];1455 -> 1464[label="",style="solid", color="black", weight=3];
2498[label="Integer (Pos vuz149) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 vuz1610 vuz151 (primGEqNatS vuz1610 vuz151))) (Pos Zero)) (Integer (Pos (Succ vuz151))) (Integer (Pos (primModNatS0 vuz1610 vuz151 (primGEqNatS vuz1610 vuz151))))",fontsize=16,color="burlywood",shape="box"];3578[label="vuz1610/Succ vuz16100",fontsize=10,color="white",style="solid",shape="box"];2498 -> 3578[label="",style="solid", color="burlywood", weight=9];
3578 -> 2556[label="",style="solid", color="burlywood", weight=3];
3579[label="vuz1610/Zero",fontsize=10,color="white",style="solid",shape="box"];2498 -> 3579[label="",style="solid", color="burlywood", weight=9];
3579 -> 2557[label="",style="solid", color="burlywood", weight=3];
2499[label="Integer (Pos vuz149) `quot` gcd0Gcd'1 (primEqInt (Pos Zero) (Pos Zero)) (Integer (Pos (Succ vuz151))) (Integer (Pos Zero))",fontsize=16,color="black",shape="box"];2499 -> 2558[label="",style="solid", color="black", weight=3];
1456[label="Integer (Neg vuz81) `quot` gcd0Gcd'1 (primEqInt (primRemInt (Pos (Succ vuz820)) (Pos (Succ vuz3100))) (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (primRemInt (Pos (Succ vuz820)) (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="triangle"];1456 -> 1465[label="",style="solid", color="black", weight=3];
1457[label="Integer (Neg vuz81) `quot` Integer (Pos (Succ vuz3100))",fontsize=16,color="black",shape="triangle"];1457 -> 1466[label="",style="solid", color="black", weight=3];
1463 -> 1433[label="",style="dashed", color="red", weight=0];
1463[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (primEqInt (primRemInt (Pos (Succ vuz900)) (Pos (Succ vuz3100))) (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (primRemInt (Pos (Succ vuz900)) (Pos (Succ vuz3100))))",fontsize=16,color="magenta"];1463 -> 1472[label="",style="dashed", color="magenta", weight=3];
1463 -> 1473[label="",style="dashed", color="magenta", weight=3];
1464 -> 1453[label="",style="dashed", color="red", weight=0];
1464[label="Integer (Pos (Succ vuz3100)) `quot` Integer (Pos (Succ vuz3100))",fontsize=16,color="magenta"];1464 -> 1474[label="",style="dashed", color="magenta", weight=3];
2556[label="Integer (Pos vuz149) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz16100) vuz151 (primGEqNatS (Succ vuz16100) vuz151))) (Pos Zero)) (Integer (Pos (Succ vuz151))) (Integer (Pos (primModNatS0 (Succ vuz16100) vuz151 (primGEqNatS (Succ vuz16100) vuz151))))",fontsize=16,color="burlywood",shape="box"];3582[label="vuz151/Succ vuz1510",fontsize=10,color="white",style="solid",shape="box"];2556 -> 3582[label="",style="solid", color="burlywood", weight=9];
3582 -> 2566[label="",style="solid", color="burlywood", weight=3];
3583[label="vuz151/Zero",fontsize=10,color="white",style="solid",shape="box"];2556 -> 3583[label="",style="solid", color="burlywood", weight=9];
3583 -> 2567[label="",style="solid", color="burlywood", weight=3];
2557[label="Integer (Pos vuz149) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero vuz151 (primGEqNatS Zero vuz151))) (Pos Zero)) (Integer (Pos (Succ vuz151))) (Integer (Pos (primModNatS0 Zero vuz151 (primGEqNatS Zero vuz151))))",fontsize=16,color="burlywood",shape="box"];3584[label="vuz151/Succ vuz1510",fontsize=10,color="white",style="solid",shape="box"];2557 -> 3584[label="",style="solid", color="burlywood", weight=9];
3584 -> 2568[label="",style="solid", color="burlywood", weight=3];
3585[label="vuz151/Zero",fontsize=10,color="white",style="solid",shape="box"];2557 -> 3585[label="",style="solid", color="burlywood", weight=9];
3585 -> 2569[label="",style="solid", color="burlywood", weight=3];
2558[label="Integer (Pos vuz149) `quot` gcd0Gcd'1 True (Integer (Pos (Succ vuz151))) (Integer (Pos Zero))",fontsize=16,color="black",shape="box"];2558 -> 2570[label="",style="solid", color="black", weight=3];
1465 -> 2622[label="",style="dashed", color="red", weight=0];
1465[label="Integer (Neg vuz81) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (Succ vuz820) (Succ vuz3100))) (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (Pos (primModNatS (Succ vuz820) (Succ vuz3100))))",fontsize=16,color="magenta"];1465 -> 2623[label="",style="dashed", color="magenta", weight=3];
1465 -> 2624[label="",style="dashed", color="magenta", weight=3];
1465 -> 2625[label="",style="dashed", color="magenta", weight=3];
1465 -> 2626[label="",style="dashed", color="magenta", weight=3];
1466[label="Integer (primQuotInt (Neg vuz81) (Pos (Succ vuz3100)))",fontsize=16,color="green",shape="box"];1466 -> 1476[label="",style="dashed", color="green", weight=3];
1472[label="vuz900",fontsize=16,color="green",shape="box"];1473[label="Succ vuz3100",fontsize=16,color="green",shape="box"];1474[label="Succ vuz3100",fontsize=16,color="green",shape="box"];1453[label="Integer (Pos vuz72) `quot` Integer (Pos (Succ vuz3100))",fontsize=16,color="black",shape="triangle"];1453 -> 1462[label="",style="solid", color="black", weight=3];
2566[label="Integer (Pos vuz149) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz16100) (Succ vuz1510) (primGEqNatS (Succ vuz16100) (Succ vuz1510)))) (Pos Zero)) (Integer (Pos (Succ (Succ vuz1510)))) (Integer (Pos (primModNatS0 (Succ vuz16100) (Succ vuz1510) (primGEqNatS (Succ vuz16100) (Succ vuz1510)))))",fontsize=16,color="black",shape="box"];2566 -> 2577[label="",style="solid", color="black", weight=3];
2567[label="Integer (Pos vuz149) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz16100) Zero (primGEqNatS (Succ vuz16100) Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 (Succ vuz16100) Zero (primGEqNatS (Succ vuz16100) Zero))))",fontsize=16,color="black",shape="box"];2567 -> 2578[label="",style="solid", color="black", weight=3];
2568[label="Integer (Pos vuz149) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero (Succ vuz1510) (primGEqNatS Zero (Succ vuz1510)))) (Pos Zero)) (Integer (Pos (Succ (Succ vuz1510)))) (Integer (Pos (primModNatS0 Zero (Succ vuz1510) (primGEqNatS Zero (Succ vuz1510)))))",fontsize=16,color="black",shape="box"];2568 -> 2579[label="",style="solid", color="black", weight=3];
2569[label="Integer (Pos vuz149) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero Zero (primGEqNatS Zero Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 Zero Zero (primGEqNatS Zero Zero))))",fontsize=16,color="black",shape="box"];2569 -> 2580[label="",style="solid", color="black", weight=3];
2570 -> 1453[label="",style="dashed", color="red", weight=0];
2570[label="Integer (Pos vuz149) `quot` Integer (Pos (Succ vuz151))",fontsize=16,color="magenta"];2570 -> 2581[label="",style="dashed", color="magenta", weight=3];
2570 -> 2582[label="",style="dashed", color="magenta", weight=3];
2623[label="Succ vuz820",fontsize=16,color="green",shape="box"];2624[label="Succ vuz820",fontsize=16,color="green",shape="box"];2625[label="vuz81",fontsize=16,color="green",shape="box"];2626[label="vuz3100",fontsize=16,color="green",shape="box"];2622[label="Integer (Neg vuz163) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS vuz173 (Succ vuz165))) (Pos Zero)) (Integer (Pos (Succ vuz165))) (Integer (Pos (primModNatS vuz172 (Succ vuz165))))",fontsize=16,color="burlywood",shape="triangle"];3588[label="vuz173/Succ vuz1730",fontsize=10,color="white",style="solid",shape="box"];2622 -> 3588[label="",style="solid", color="burlywood", weight=9];
3588 -> 2645[label="",style="solid", color="burlywood", weight=3];
3589[label="vuz173/Zero",fontsize=10,color="white",style="solid",shape="box"];2622 -> 3589[label="",style="solid", color="burlywood", weight=9];
3589 -> 2646[label="",style="solid", color="burlywood", weight=3];
1476[label="primQuotInt (Neg vuz81) (Pos (Succ vuz3100))",fontsize=16,color="black",shape="box"];1476 -> 1485[label="",style="solid", color="black", weight=3];
1462[label="Integer (primQuotInt (Pos vuz72) (Pos (Succ vuz3100)))",fontsize=16,color="green",shape="box"];1462 -> 1471[label="",style="dashed", color="green", weight=3];
2577 -> 3255[label="",style="dashed", color="red", weight=0];
2577[label="Integer (Pos vuz149) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz16100) (Succ vuz1510) (primGEqNatS vuz16100 vuz1510))) (Pos Zero)) (Integer (Pos (Succ (Succ vuz1510)))) (Integer (Pos (primModNatS0 (Succ vuz16100) (Succ vuz1510) (primGEqNatS vuz16100 vuz1510))))",fontsize=16,color="magenta"];2577 -> 3256[label="",style="dashed", color="magenta", weight=3];
2577 -> 3257[label="",style="dashed", color="magenta", weight=3];
2577 -> 3258[label="",style="dashed", color="magenta", weight=3];
2577 -> 3259[label="",style="dashed", color="magenta", weight=3];
2577 -> 3260[label="",style="dashed", color="magenta", weight=3];
2578[label="Integer (Pos vuz149) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz16100) Zero True)) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 (Succ vuz16100) Zero True)))",fontsize=16,color="black",shape="box"];2578 -> 2597[label="",style="solid", color="black", weight=3];
2579[label="Integer (Pos vuz149) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero (Succ vuz1510) False)) (Pos Zero)) (Integer (Pos (Succ (Succ vuz1510)))) (Integer (Pos (primModNatS0 Zero (Succ vuz1510) False)))",fontsize=16,color="black",shape="box"];2579 -> 2598[label="",style="solid", color="black", weight=3];
2580[label="Integer (Pos vuz149) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero Zero True)) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 Zero Zero True)))",fontsize=16,color="black",shape="box"];2580 -> 2599[label="",style="solid", color="black", weight=3];
2581[label="vuz149",fontsize=16,color="green",shape="box"];2582[label="vuz151",fontsize=16,color="green",shape="box"];2645[label="Integer (Neg vuz163) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (Succ vuz1730) (Succ vuz165))) (Pos Zero)) (Integer (Pos (Succ vuz165))) (Integer (Pos (primModNatS vuz172 (Succ vuz165))))",fontsize=16,color="black",shape="box"];2645 -> 2664[label="",style="solid", color="black", weight=3];
2646[label="Integer (Neg vuz163) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS Zero (Succ vuz165))) (Pos Zero)) (Integer (Pos (Succ vuz165))) (Integer (Pos (primModNatS vuz172 (Succ vuz165))))",fontsize=16,color="black",shape="box"];2646 -> 2665[label="",style="solid", color="black", weight=3];
1485[label="Neg (primDivNatS vuz81 (Succ vuz3100))",fontsize=16,color="green",shape="box"];1485 -> 1498[label="",style="dashed", color="green", weight=3];
1471[label="primQuotInt (Pos vuz72) (Pos (Succ vuz3100))",fontsize=16,color="black",shape="box"];1471 -> 1482[label="",style="solid", color="black", weight=3];
3256[label="Succ vuz1510",fontsize=16,color="green",shape="box"];3257[label="vuz1510",fontsize=16,color="green",shape="box"];3258[label="vuz16100",fontsize=16,color="green",shape="box"];3259[label="vuz16100",fontsize=16,color="green",shape="box"];3260[label="vuz149",fontsize=16,color="green",shape="box"];3255[label="Integer (Pos vuz202) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz203) vuz204 (primGEqNatS vuz205 vuz206))) (Pos Zero)) (Integer (Pos (Succ vuz204))) (Integer (Pos (primModNatS0 (Succ vuz203) vuz204 (primGEqNatS vuz205 vuz206))))",fontsize=16,color="burlywood",shape="triangle"];3591[label="vuz205/Succ vuz2050",fontsize=10,color="white",style="solid",shape="box"];3255 -> 3591[label="",style="solid", color="burlywood", weight=9];
3591 -> 3306[label="",style="solid", color="burlywood", weight=3];
3592[label="vuz205/Zero",fontsize=10,color="white",style="solid",shape="box"];3255 -> 3592[label="",style="solid", color="burlywood", weight=9];
3592 -> 3307[label="",style="solid", color="burlywood", weight=3];
2597 -> 2454[label="",style="dashed", color="red", weight=0];
2597[label="Integer (Pos vuz149) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (primMinusNatS (Succ vuz16100) Zero) (Succ Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS (primMinusNatS (Succ vuz16100) Zero) (Succ Zero))))",fontsize=16,color="magenta"];2597 -> 2615[label="",style="dashed", color="magenta", weight=3];
2597 -> 2616[label="",style="dashed", color="magenta", weight=3];
2597 -> 2617[label="",style="dashed", color="magenta", weight=3];
2598[label="Integer (Pos vuz149) `quot` gcd0Gcd'1 (primEqInt (Pos (Succ Zero)) (Pos Zero)) (Integer (Pos (Succ (Succ vuz1510)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];2598 -> 2618[label="",style="solid", color="black", weight=3];
2599 -> 2454[label="",style="dashed", color="red", weight=0];
2599[label="Integer (Pos vuz149) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (primMinusNatS Zero Zero) (Succ Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS (primMinusNatS Zero Zero) (Succ Zero))))",fontsize=16,color="magenta"];2599 -> 2619[label="",style="dashed", color="magenta", weight=3];
2599 -> 2620[label="",style="dashed", color="magenta", weight=3];
2599 -> 2621[label="",style="dashed", color="magenta", weight=3];
2664[label="Integer (Neg vuz163) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 vuz1730 vuz165 (primGEqNatS vuz1730 vuz165))) (Pos Zero)) (Integer (Pos (Succ vuz165))) (Integer (Pos (primModNatS0 vuz1730 vuz165 (primGEqNatS vuz1730 vuz165))))",fontsize=16,color="burlywood",shape="box"];3595[label="vuz1730/Succ vuz17300",fontsize=10,color="white",style="solid",shape="box"];2664 -> 3595[label="",style="solid", color="burlywood", weight=9];
3595 -> 2675[label="",style="solid", color="burlywood", weight=3];
3596[label="vuz1730/Zero",fontsize=10,color="white",style="solid",shape="box"];2664 -> 3596[label="",style="solid", color="burlywood", weight=9];
3596 -> 2676[label="",style="solid", color="burlywood", weight=3];
2665[label="Integer (Neg vuz163) `quot` gcd0Gcd'1 (primEqInt (Pos Zero) (Pos Zero)) (Integer (Pos (Succ vuz165))) (Integer (Pos Zero))",fontsize=16,color="black",shape="box"];2665 -> 2677[label="",style="solid", color="black", weight=3];
1498 -> 1493[label="",style="dashed", color="red", weight=0];
1498[label="primDivNatS vuz81 (Succ vuz3100)",fontsize=16,color="magenta"];1498 -> 1513[label="",style="dashed", color="magenta", weight=3];
1482[label="Pos (primDivNatS vuz72 (Succ vuz3100))",fontsize=16,color="green",shape="box"];1482 -> 1493[label="",style="dashed", color="green", weight=3];
3306[label="Integer (Pos vuz202) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz203) vuz204 (primGEqNatS (Succ vuz2050) vuz206))) (Pos Zero)) (Integer (Pos (Succ vuz204))) (Integer (Pos (primModNatS0 (Succ vuz203) vuz204 (primGEqNatS (Succ vuz2050) vuz206))))",fontsize=16,color="burlywood",shape="box"];3598[label="vuz206/Succ vuz2060",fontsize=10,color="white",style="solid",shape="box"];3306 -> 3598[label="",style="solid", color="burlywood", weight=9];
3598 -> 3313[label="",style="solid", color="burlywood", weight=3];
3599[label="vuz206/Zero",fontsize=10,color="white",style="solid",shape="box"];3306 -> 3599[label="",style="solid", color="burlywood", weight=9];
3599 -> 3314[label="",style="solid", color="burlywood", weight=3];
3307[label="Integer (Pos vuz202) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz203) vuz204 (primGEqNatS Zero vuz206))) (Pos Zero)) (Integer (Pos (Succ vuz204))) (Integer (Pos (primModNatS0 (Succ vuz203) vuz204 (primGEqNatS Zero vuz206))))",fontsize=16,color="burlywood",shape="box"];3600[label="vuz206/Succ vuz2060",fontsize=10,color="white",style="solid",shape="box"];3307 -> 3600[label="",style="solid", color="burlywood", weight=9];
3600 -> 3315[label="",style="solid", color="burlywood", weight=3];
3601[label="vuz206/Zero",fontsize=10,color="white",style="solid",shape="box"];3307 -> 3601[label="",style="solid", color="burlywood", weight=9];
3601 -> 3316[label="",style="solid", color="burlywood", weight=3];
2615 -> 2226[label="",style="dashed", color="red", weight=0];
2615[label="primMinusNatS (Succ vuz16100) Zero",fontsize=16,color="magenta"];2615 -> 2651[label="",style="dashed", color="magenta", weight=3];
2615 -> 2652[label="",style="dashed", color="magenta", weight=3];
2616[label="Zero",fontsize=16,color="green",shape="box"];2617 -> 2226[label="",style="dashed", color="red", weight=0];
2617[label="primMinusNatS (Succ vuz16100) Zero",fontsize=16,color="magenta"];2617 -> 2653[label="",style="dashed", color="magenta", weight=3];
2617 -> 2654[label="",style="dashed", color="magenta", weight=3];
2618[label="Integer (Pos vuz149) `quot` gcd0Gcd'1 False (Integer (Pos (Succ (Succ vuz1510)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];2618 -> 2655[label="",style="solid", color="black", weight=3];
2619 -> 2226[label="",style="dashed", color="red", weight=0];
2619[label="primMinusNatS Zero Zero",fontsize=16,color="magenta"];2619 -> 2656[label="",style="dashed", color="magenta", weight=3];
2619 -> 2657[label="",style="dashed", color="magenta", weight=3];
2620[label="Zero",fontsize=16,color="green",shape="box"];2621 -> 2226[label="",style="dashed", color="red", weight=0];
2621[label="primMinusNatS Zero Zero",fontsize=16,color="magenta"];2621 -> 2658[label="",style="dashed", color="magenta", weight=3];
2621 -> 2659[label="",style="dashed", color="magenta", weight=3];
2675[label="Integer (Neg vuz163) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz17300) vuz165 (primGEqNatS (Succ vuz17300) vuz165))) (Pos Zero)) (Integer (Pos (Succ vuz165))) (Integer (Pos (primModNatS0 (Succ vuz17300) vuz165 (primGEqNatS (Succ vuz17300) vuz165))))",fontsize=16,color="burlywood",shape="box"];3606[label="vuz165/Succ vuz1650",fontsize=10,color="white",style="solid",shape="box"];2675 -> 3606[label="",style="solid", color="burlywood", weight=9];
3606 -> 2692[label="",style="solid", color="burlywood", weight=3];
3607[label="vuz165/Zero",fontsize=10,color="white",style="solid",shape="box"];2675 -> 3607[label="",style="solid", color="burlywood", weight=9];
3607 -> 2693[label="",style="solid", color="burlywood", weight=3];
2676[label="Integer (Neg vuz163) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero vuz165 (primGEqNatS Zero vuz165))) (Pos Zero)) (Integer (Pos (Succ vuz165))) (Integer (Pos (primModNatS0 Zero vuz165 (primGEqNatS Zero vuz165))))",fontsize=16,color="burlywood",shape="box"];3608[label="vuz165/Succ vuz1650",fontsize=10,color="white",style="solid",shape="box"];2676 -> 3608[label="",style="solid", color="burlywood", weight=9];
3608 -> 2694[label="",style="solid", color="burlywood", weight=3];
3609[label="vuz165/Zero",fontsize=10,color="white",style="solid",shape="box"];2676 -> 3609[label="",style="solid", color="burlywood", weight=9];
3609 -> 2695[label="",style="solid", color="burlywood", weight=3];
2677[label="Integer (Neg vuz163) `quot` gcd0Gcd'1 True (Integer (Pos (Succ vuz165))) (Integer (Pos Zero))",fontsize=16,color="black",shape="box"];2677 -> 2696[label="",style="solid", color="black", weight=3];
1513[label="vuz81",fontsize=16,color="green",shape="box"];1493[label="primDivNatS vuz72 (Succ vuz3100)",fontsize=16,color="burlywood",shape="triangle"];3610[label="vuz72/Succ vuz720",fontsize=10,color="white",style="solid",shape="box"];1493 -> 3610[label="",style="solid", color="burlywood", weight=9];
3610 -> 1507[label="",style="solid", color="burlywood", weight=3];
3611[label="vuz72/Zero",fontsize=10,color="white",style="solid",shape="box"];1493 -> 3611[label="",style="solid", color="burlywood", weight=9];
3611 -> 1508[label="",style="solid", color="burlywood", weight=3];
3313[label="Integer (Pos vuz202) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz203) vuz204 (primGEqNatS (Succ vuz2050) (Succ vuz2060)))) (Pos Zero)) (Integer (Pos (Succ vuz204))) (Integer (Pos (primModNatS0 (Succ vuz203) vuz204 (primGEqNatS (Succ vuz2050) (Succ vuz2060)))))",fontsize=16,color="black",shape="box"];3313 -> 3321[label="",style="solid", color="black", weight=3];
3314[label="Integer (Pos vuz202) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz203) vuz204 (primGEqNatS (Succ vuz2050) Zero))) (Pos Zero)) (Integer (Pos (Succ vuz204))) (Integer (Pos (primModNatS0 (Succ vuz203) vuz204 (primGEqNatS (Succ vuz2050) Zero))))",fontsize=16,color="black",shape="box"];3314 -> 3322[label="",style="solid", color="black", weight=3];
3315[label="Integer (Pos vuz202) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz203) vuz204 (primGEqNatS Zero (Succ vuz2060)))) (Pos Zero)) (Integer (Pos (Succ vuz204))) (Integer (Pos (primModNatS0 (Succ vuz203) vuz204 (primGEqNatS Zero (Succ vuz2060)))))",fontsize=16,color="black",shape="box"];3315 -> 3323[label="",style="solid", color="black", weight=3];
3316[label="Integer (Pos vuz202) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz203) vuz204 (primGEqNatS Zero Zero))) (Pos Zero)) (Integer (Pos (Succ vuz204))) (Integer (Pos (primModNatS0 (Succ vuz203) vuz204 (primGEqNatS Zero Zero))))",fontsize=16,color="black",shape="box"];3316 -> 3324[label="",style="solid", color="black", weight=3];
2651[label="Zero",fontsize=16,color="green",shape="box"];2652[label="Succ vuz16100",fontsize=16,color="green",shape="box"];2226[label="primMinusNatS vuz1300 vuz131",fontsize=16,color="burlywood",shape="triangle"];3612[label="vuz1300/Succ vuz13000",fontsize=10,color="white",style="solid",shape="box"];2226 -> 3612[label="",style="solid", color="burlywood", weight=9];
3612 -> 2238[label="",style="solid", color="burlywood", weight=3];
3613[label="vuz1300/Zero",fontsize=10,color="white",style="solid",shape="box"];2226 -> 3613[label="",style="solid", color="burlywood", weight=9];
3613 -> 2239[label="",style="solid", color="burlywood", weight=3];
2653[label="Zero",fontsize=16,color="green",shape="box"];2654[label="Succ vuz16100",fontsize=16,color="green",shape="box"];2655[label="Integer (Pos vuz149) `quot` gcd0Gcd'0 (Integer (Pos (Succ (Succ vuz1510)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];2655 -> 2671[label="",style="solid", color="black", weight=3];
2656[label="Zero",fontsize=16,color="green",shape="box"];2657[label="Zero",fontsize=16,color="green",shape="box"];2658[label="Zero",fontsize=16,color="green",shape="box"];2659[label="Zero",fontsize=16,color="green",shape="box"];2692[label="Integer (Neg vuz163) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz17300) (Succ vuz1650) (primGEqNatS (Succ vuz17300) (Succ vuz1650)))) (Pos Zero)) (Integer (Pos (Succ (Succ vuz1650)))) (Integer (Pos (primModNatS0 (Succ vuz17300) (Succ vuz1650) (primGEqNatS (Succ vuz17300) (Succ vuz1650)))))",fontsize=16,color="black",shape="box"];2692 -> 2754[label="",style="solid", color="black", weight=3];
2693[label="Integer (Neg vuz163) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz17300) Zero (primGEqNatS (Succ vuz17300) Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 (Succ vuz17300) Zero (primGEqNatS (Succ vuz17300) Zero))))",fontsize=16,color="black",shape="box"];2693 -> 2755[label="",style="solid", color="black", weight=3];
2694[label="Integer (Neg vuz163) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero (Succ vuz1650) (primGEqNatS Zero (Succ vuz1650)))) (Pos Zero)) (Integer (Pos (Succ (Succ vuz1650)))) (Integer (Pos (primModNatS0 Zero (Succ vuz1650) (primGEqNatS Zero (Succ vuz1650)))))",fontsize=16,color="black",shape="box"];2694 -> 2756[label="",style="solid", color="black", weight=3];
2695[label="Integer (Neg vuz163) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero Zero (primGEqNatS Zero Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 Zero Zero (primGEqNatS Zero Zero))))",fontsize=16,color="black",shape="box"];2695 -> 2757[label="",style="solid", color="black", weight=3];
2696 -> 1457[label="",style="dashed", color="red", weight=0];
2696[label="Integer (Neg vuz163) `quot` Integer (Pos (Succ vuz165))",fontsize=16,color="magenta"];2696 -> 2758[label="",style="dashed", color="magenta", weight=3];
2696 -> 2759[label="",style="dashed", color="magenta", weight=3];
1507[label="primDivNatS (Succ vuz720) (Succ vuz3100)",fontsize=16,color="black",shape="box"];1507 -> 1520[label="",style="solid", color="black", weight=3];
1508[label="primDivNatS Zero (Succ vuz3100)",fontsize=16,color="black",shape="box"];1508 -> 1521[label="",style="solid", color="black", weight=3];
3321 -> 3255[label="",style="dashed", color="red", weight=0];
3321[label="Integer (Pos vuz202) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz203) vuz204 (primGEqNatS vuz2050 vuz2060))) (Pos Zero)) (Integer (Pos (Succ vuz204))) (Integer (Pos (primModNatS0 (Succ vuz203) vuz204 (primGEqNatS vuz2050 vuz2060))))",fontsize=16,color="magenta"];3321 -> 3337[label="",style="dashed", color="magenta", weight=3];
3321 -> 3338[label="",style="dashed", color="magenta", weight=3];
3322[label="Integer (Pos vuz202) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz203) vuz204 True)) (Pos Zero)) (Integer (Pos (Succ vuz204))) (Integer (Pos (primModNatS0 (Succ vuz203) vuz204 True)))",fontsize=16,color="black",shape="triangle"];3322 -> 3339[label="",style="solid", color="black", weight=3];
3323[label="Integer (Pos vuz202) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz203) vuz204 False)) (Pos Zero)) (Integer (Pos (Succ vuz204))) (Integer (Pos (primModNatS0 (Succ vuz203) vuz204 False)))",fontsize=16,color="black",shape="box"];3323 -> 3340[label="",style="solid", color="black", weight=3];
3324 -> 3322[label="",style="dashed", color="red", weight=0];
3324[label="Integer (Pos vuz202) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz203) vuz204 True)) (Pos Zero)) (Integer (Pos (Succ vuz204))) (Integer (Pos (primModNatS0 (Succ vuz203) vuz204 True)))",fontsize=16,color="magenta"];2238[label="primMinusNatS (Succ vuz13000) vuz131",fontsize=16,color="burlywood",shape="box"];3617[label="vuz131/Succ vuz1310",fontsize=10,color="white",style="solid",shape="box"];2238 -> 3617[label="",style="solid", color="burlywood", weight=9];
3617 -> 2242[label="",style="solid", color="burlywood", weight=3];
3618[label="vuz131/Zero",fontsize=10,color="white",style="solid",shape="box"];2238 -> 3618[label="",style="solid", color="burlywood", weight=9];
3618 -> 2243[label="",style="solid", color="burlywood", weight=3];
2239[label="primMinusNatS Zero vuz131",fontsize=16,color="burlywood",shape="box"];3619[label="vuz131/Succ vuz1310",fontsize=10,color="white",style="solid",shape="box"];2239 -> 3619[label="",style="solid", color="burlywood", weight=9];
3619 -> 2244[label="",style="solid", color="burlywood", weight=3];
3620[label="vuz131/Zero",fontsize=10,color="white",style="solid",shape="box"];2239 -> 3620[label="",style="solid", color="burlywood", weight=9];
3620 -> 2245[label="",style="solid", color="burlywood", weight=3];
2671[label="Integer (Pos vuz149) `quot` gcd0Gcd' (Integer (Pos (Succ Zero))) (Integer (Pos (Succ (Succ vuz1510))) `rem` Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];2671 -> 2689[label="",style="solid", color="black", weight=3];
2754 -> 3380[label="",style="dashed", color="red", weight=0];
2754[label="Integer (Neg vuz163) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz17300) (Succ vuz1650) (primGEqNatS vuz17300 vuz1650))) (Pos Zero)) (Integer (Pos (Succ (Succ vuz1650)))) (Integer (Pos (primModNatS0 (Succ vuz17300) (Succ vuz1650) (primGEqNatS vuz17300 vuz1650))))",fontsize=16,color="magenta"];2754 -> 3381[label="",style="dashed", color="magenta", weight=3];
2754 -> 3382[label="",style="dashed", color="magenta", weight=3];
2754 -> 3383[label="",style="dashed", color="magenta", weight=3];
2754 -> 3384[label="",style="dashed", color="magenta", weight=3];
2754 -> 3385[label="",style="dashed", color="magenta", weight=3];
2755[label="Integer (Neg vuz163) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz17300) Zero True)) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 (Succ vuz17300) Zero True)))",fontsize=16,color="black",shape="box"];2755 -> 2773[label="",style="solid", color="black", weight=3];
2756[label="Integer (Neg vuz163) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero (Succ vuz1650) False)) (Pos Zero)) (Integer (Pos (Succ (Succ vuz1650)))) (Integer (Pos (primModNatS0 Zero (Succ vuz1650) False)))",fontsize=16,color="black",shape="box"];2756 -> 2774[label="",style="solid", color="black", weight=3];
2757[label="Integer (Neg vuz163) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero Zero True)) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 Zero Zero True)))",fontsize=16,color="black",shape="box"];2757 -> 2775[label="",style="solid", color="black", weight=3];
2758[label="vuz165",fontsize=16,color="green",shape="box"];2759[label="vuz163",fontsize=16,color="green",shape="box"];1520[label="primDivNatS0 vuz720 vuz3100 (primGEqNatS vuz720 vuz3100)",fontsize=16,color="burlywood",shape="box"];3622[label="vuz720/Succ vuz7200",fontsize=10,color="white",style="solid",shape="box"];1520 -> 3622[label="",style="solid", color="burlywood", weight=9];
3622 -> 1535[label="",style="solid", color="burlywood", weight=3];
3623[label="vuz720/Zero",fontsize=10,color="white",style="solid",shape="box"];1520 -> 3623[label="",style="solid", color="burlywood", weight=9];
3623 -> 1536[label="",style="solid", color="burlywood", weight=3];
1521[label="Zero",fontsize=16,color="green",shape="box"];3337[label="vuz2060",fontsize=16,color="green",shape="box"];3338[label="vuz2050",fontsize=16,color="green",shape="box"];3339 -> 2454[label="",style="dashed", color="red", weight=0];
3339[label="Integer (Pos vuz202) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (primMinusNatS (Succ vuz203) vuz204) (Succ vuz204))) (Pos Zero)) (Integer (Pos (Succ vuz204))) (Integer (Pos (primModNatS (primMinusNatS (Succ vuz203) vuz204) (Succ vuz204))))",fontsize=16,color="magenta"];3339 -> 3355[label="",style="dashed", color="magenta", weight=3];
3339 -> 3356[label="",style="dashed", color="magenta", weight=3];
3339 -> 3357[label="",style="dashed", color="magenta", weight=3];
3339 -> 3358[label="",style="dashed", color="magenta", weight=3];
3340[label="Integer (Pos vuz202) `quot` gcd0Gcd'1 (primEqInt (Pos (Succ (Succ vuz203))) (Pos Zero)) (Integer (Pos (Succ vuz204))) (Integer (Pos (Succ (Succ vuz203))))",fontsize=16,color="black",shape="box"];3340 -> 3359[label="",style="solid", color="black", weight=3];
2242[label="primMinusNatS (Succ vuz13000) (Succ vuz1310)",fontsize=16,color="black",shape="box"];2242 -> 2259[label="",style="solid", color="black", weight=3];
2243[label="primMinusNatS (Succ vuz13000) Zero",fontsize=16,color="black",shape="box"];2243 -> 2260[label="",style="solid", color="black", weight=3];
2244[label="primMinusNatS Zero (Succ vuz1310)",fontsize=16,color="black",shape="box"];2244 -> 2261[label="",style="solid", color="black", weight=3];
2245[label="primMinusNatS Zero Zero",fontsize=16,color="black",shape="box"];2245 -> 2262[label="",style="solid", color="black", weight=3];
2689[label="Integer (Pos vuz149) `quot` gcd0Gcd'2 (Integer (Pos (Succ Zero))) (Integer (Pos (Succ (Succ vuz1510))) `rem` Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];2689 -> 2710[label="",style="solid", color="black", weight=3];
3381[label="Succ vuz1650",fontsize=16,color="green",shape="box"];3382[label="vuz17300",fontsize=16,color="green",shape="box"];3383[label="vuz1650",fontsize=16,color="green",shape="box"];3384[label="vuz163",fontsize=16,color="green",shape="box"];3385[label="vuz17300",fontsize=16,color="green",shape="box"];3380[label="Integer (Neg vuz216) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz217) vuz218 (primGEqNatS vuz219 vuz220))) (Pos Zero)) (Integer (Pos (Succ vuz218))) (Integer (Pos (primModNatS0 (Succ vuz217) vuz218 (primGEqNatS vuz219 vuz220))))",fontsize=16,color="burlywood",shape="triangle"];3625[label="vuz219/Succ vuz2190",fontsize=10,color="white",style="solid",shape="box"];3380 -> 3625[label="",style="solid", color="burlywood", weight=9];
3625 -> 3431[label="",style="solid", color="burlywood", weight=3];
3626[label="vuz219/Zero",fontsize=10,color="white",style="solid",shape="box"];3380 -> 3626[label="",style="solid", color="burlywood", weight=9];
3626 -> 3432[label="",style="solid", color="burlywood", weight=3];
2773 -> 2622[label="",style="dashed", color="red", weight=0];
2773[label="Integer (Neg vuz163) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (primMinusNatS (Succ vuz17300) Zero) (Succ Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS (primMinusNatS (Succ vuz17300) Zero) (Succ Zero))))",fontsize=16,color="magenta"];2773 -> 2796[label="",style="dashed", color="magenta", weight=3];
2773 -> 2797[label="",style="dashed", color="magenta", weight=3];
2773 -> 2798[label="",style="dashed", color="magenta", weight=3];
2774[label="Integer (Neg vuz163) `quot` gcd0Gcd'1 (primEqInt (Pos (Succ Zero)) (Pos Zero)) (Integer (Pos (Succ (Succ vuz1650)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];2774 -> 2799[label="",style="solid", color="black", weight=3];
2775 -> 2622[label="",style="dashed", color="red", weight=0];
2775[label="Integer (Neg vuz163) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (primMinusNatS Zero Zero) (Succ Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS (primMinusNatS Zero Zero) (Succ Zero))))",fontsize=16,color="magenta"];2775 -> 2800[label="",style="dashed", color="magenta", weight=3];
2775 -> 2801[label="",style="dashed", color="magenta", weight=3];
2775 -> 2802[label="",style="dashed", color="magenta", weight=3];
1535[label="primDivNatS0 (Succ vuz7200) vuz3100 (primGEqNatS (Succ vuz7200) vuz3100)",fontsize=16,color="burlywood",shape="box"];3629[label="vuz3100/Succ vuz31000",fontsize=10,color="white",style="solid",shape="box"];1535 -> 3629[label="",style="solid", color="burlywood", weight=9];
3629 -> 1553[label="",style="solid", color="burlywood", weight=3];
3630[label="vuz3100/Zero",fontsize=10,color="white",style="solid",shape="box"];1535 -> 3630[label="",style="solid", color="burlywood", weight=9];
3630 -> 1554[label="",style="solid", color="burlywood", weight=3];
1536[label="primDivNatS0 Zero vuz3100 (primGEqNatS Zero vuz3100)",fontsize=16,color="burlywood",shape="box"];3631[label="vuz3100/Succ vuz31000",fontsize=10,color="white",style="solid",shape="box"];1536 -> 3631[label="",style="solid", color="burlywood", weight=9];
3631 -> 1555[label="",style="solid", color="burlywood", weight=3];
3632[label="vuz3100/Zero",fontsize=10,color="white",style="solid",shape="box"];1536 -> 3632[label="",style="solid", color="burlywood", weight=9];
3632 -> 1556[label="",style="solid", color="burlywood", weight=3];
3355[label="vuz202",fontsize=16,color="green",shape="box"];3356 -> 2226[label="",style="dashed", color="red", weight=0];
3356[label="primMinusNatS (Succ vuz203) vuz204",fontsize=16,color="magenta"];3356 -> 3371[label="",style="dashed", color="magenta", weight=3];
3356 -> 3372[label="",style="dashed", color="magenta", weight=3];
3357[label="vuz204",fontsize=16,color="green",shape="box"];3358 -> 2226[label="",style="dashed", color="red", weight=0];
3358[label="primMinusNatS (Succ vuz203) vuz204",fontsize=16,color="magenta"];3358 -> 3373[label="",style="dashed", color="magenta", weight=3];
3358 -> 3374[label="",style="dashed", color="magenta", weight=3];
3359[label="Integer (Pos vuz202) `quot` gcd0Gcd'1 False (Integer (Pos (Succ vuz204))) (Integer (Pos (Succ (Succ vuz203))))",fontsize=16,color="black",shape="box"];3359 -> 3375[label="",style="solid", color="black", weight=3];
2259 -> 2226[label="",style="dashed", color="red", weight=0];
2259[label="primMinusNatS vuz13000 vuz1310",fontsize=16,color="magenta"];2259 -> 2308[label="",style="dashed", color="magenta", weight=3];
2259 -> 2309[label="",style="dashed", color="magenta", weight=3];
2260[label="Succ vuz13000",fontsize=16,color="green",shape="box"];2261[label="Zero",fontsize=16,color="green",shape="box"];2262[label="Zero",fontsize=16,color="green",shape="box"];2710 -> 1415[label="",style="dashed", color="red", weight=0];
2710[label="Integer (Pos vuz149) `quot` gcd0Gcd'1 (Integer (Pos (Succ (Succ vuz1510))) `rem` Integer (Pos (Succ Zero)) == fromInt (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (Succ (Succ vuz1510))) `rem` Integer (Pos (Succ Zero)))",fontsize=16,color="magenta"];2710 -> 2766[label="",style="dashed", color="magenta", weight=3];
2710 -> 2767[label="",style="dashed", color="magenta", weight=3];
2710 -> 2768[label="",style="dashed", color="magenta", weight=3];
3431[label="Integer (Neg vuz216) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz217) vuz218 (primGEqNatS (Succ vuz2190) vuz220))) (Pos Zero)) (Integer (Pos (Succ vuz218))) (Integer (Pos (primModNatS0 (Succ vuz217) vuz218 (primGEqNatS (Succ vuz2190) vuz220))))",fontsize=16,color="burlywood",shape="box"];3637[label="vuz220/Succ vuz2200",fontsize=10,color="white",style="solid",shape="box"];3431 -> 3637[label="",style="solid", color="burlywood", weight=9];
3637 -> 3434[label="",style="solid", color="burlywood", weight=3];
3638[label="vuz220/Zero",fontsize=10,color="white",style="solid",shape="box"];3431 -> 3638[label="",style="solid", color="burlywood", weight=9];
3638 -> 3435[label="",style="solid", color="burlywood", weight=3];
3432[label="Integer (Neg vuz216) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz217) vuz218 (primGEqNatS Zero vuz220))) (Pos Zero)) (Integer (Pos (Succ vuz218))) (Integer (Pos (primModNatS0 (Succ vuz217) vuz218 (primGEqNatS Zero vuz220))))",fontsize=16,color="burlywood",shape="box"];3639[label="vuz220/Succ vuz2200",fontsize=10,color="white",style="solid",shape="box"];3432 -> 3639[label="",style="solid", color="burlywood", weight=9];
3639 -> 3436[label="",style="solid", color="burlywood", weight=3];
3640[label="vuz220/Zero",fontsize=10,color="white",style="solid",shape="box"];3432 -> 3640[label="",style="solid", color="burlywood", weight=9];
3640 -> 3437[label="",style="solid", color="burlywood", weight=3];
2796 -> 2226[label="",style="dashed", color="red", weight=0];
2796[label="primMinusNatS (Succ vuz17300) Zero",fontsize=16,color="magenta"];2796 -> 2825[label="",style="dashed", color="magenta", weight=3];
2796 -> 2826[label="",style="dashed", color="magenta", weight=3];
2797 -> 2226[label="",style="dashed", color="red", weight=0];
2797[label="primMinusNatS (Succ vuz17300) Zero",fontsize=16,color="magenta"];2797 -> 2827[label="",style="dashed", color="magenta", weight=3];
2797 -> 2828[label="",style="dashed", color="magenta", weight=3];
2798[label="Zero",fontsize=16,color="green",shape="box"];2799[label="Integer (Neg vuz163) `quot` gcd0Gcd'1 False (Integer (Pos (Succ (Succ vuz1650)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];2799 -> 2829[label="",style="solid", color="black", weight=3];
2800 -> 2226[label="",style="dashed", color="red", weight=0];
2800[label="primMinusNatS Zero Zero",fontsize=16,color="magenta"];2800 -> 2830[label="",style="dashed", color="magenta", weight=3];
2800 -> 2831[label="",style="dashed", color="magenta", weight=3];
2801 -> 2226[label="",style="dashed", color="red", weight=0];
2801[label="primMinusNatS Zero Zero",fontsize=16,color="magenta"];2801 -> 2832[label="",style="dashed", color="magenta", weight=3];
2801 -> 2833[label="",style="dashed", color="magenta", weight=3];
2802[label="Zero",fontsize=16,color="green",shape="box"];1553[label="primDivNatS0 (Succ vuz7200) (Succ vuz31000) (primGEqNatS (Succ vuz7200) (Succ vuz31000))",fontsize=16,color="black",shape="box"];1553 -> 1576[label="",style="solid", color="black", weight=3];
1554[label="primDivNatS0 (Succ vuz7200) Zero (primGEqNatS (Succ vuz7200) Zero)",fontsize=16,color="black",shape="box"];1554 -> 1577[label="",style="solid", color="black", weight=3];
1555[label="primDivNatS0 Zero (Succ vuz31000) (primGEqNatS Zero (Succ vuz31000))",fontsize=16,color="black",shape="box"];1555 -> 1578[label="",style="solid", color="black", weight=3];
1556[label="primDivNatS0 Zero Zero (primGEqNatS Zero Zero)",fontsize=16,color="black",shape="box"];1556 -> 1579[label="",style="solid", color="black", weight=3];
3371[label="vuz204",fontsize=16,color="green",shape="box"];3372[label="Succ vuz203",fontsize=16,color="green",shape="box"];3373[label="vuz204",fontsize=16,color="green",shape="box"];3374[label="Succ vuz203",fontsize=16,color="green",shape="box"];3375[label="Integer (Pos vuz202) `quot` gcd0Gcd'0 (Integer (Pos (Succ vuz204))) (Integer (Pos (Succ (Succ vuz203))))",fontsize=16,color="black",shape="box"];3375 -> 3433[label="",style="solid", color="black", weight=3];
2308[label="vuz1310",fontsize=16,color="green",shape="box"];2309[label="vuz13000",fontsize=16,color="green",shape="box"];2766[label="Succ vuz1510",fontsize=16,color="green",shape="box"];2767[label="vuz149",fontsize=16,color="green",shape="box"];2768[label="Zero",fontsize=16,color="green",shape="box"];3434[label="Integer (Neg vuz216) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz217) vuz218 (primGEqNatS (Succ vuz2190) (Succ vuz2200)))) (Pos Zero)) (Integer (Pos (Succ vuz218))) (Integer (Pos (primModNatS0 (Succ vuz217) vuz218 (primGEqNatS (Succ vuz2190) (Succ vuz2200)))))",fontsize=16,color="black",shape="box"];3434 -> 3439[label="",style="solid", color="black", weight=3];
3435[label="Integer (Neg vuz216) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz217) vuz218 (primGEqNatS (Succ vuz2190) Zero))) (Pos Zero)) (Integer (Pos (Succ vuz218))) (Integer (Pos (primModNatS0 (Succ vuz217) vuz218 (primGEqNatS (Succ vuz2190) Zero))))",fontsize=16,color="black",shape="box"];3435 -> 3440[label="",style="solid", color="black", weight=3];
3436[label="Integer (Neg vuz216) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz217) vuz218 (primGEqNatS Zero (Succ vuz2200)))) (Pos Zero)) (Integer (Pos (Succ vuz218))) (Integer (Pos (primModNatS0 (Succ vuz217) vuz218 (primGEqNatS Zero (Succ vuz2200)))))",fontsize=16,color="black",shape="box"];3436 -> 3441[label="",style="solid", color="black", weight=3];
3437[label="Integer (Neg vuz216) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz217) vuz218 (primGEqNatS Zero Zero))) (Pos Zero)) (Integer (Pos (Succ vuz218))) (Integer (Pos (primModNatS0 (Succ vuz217) vuz218 (primGEqNatS Zero Zero))))",fontsize=16,color="black",shape="box"];3437 -> 3442[label="",style="solid", color="black", weight=3];
2825[label="Zero",fontsize=16,color="green",shape="box"];2826[label="Succ vuz17300",fontsize=16,color="green",shape="box"];2827[label="Zero",fontsize=16,color="green",shape="box"];2828[label="Succ vuz17300",fontsize=16,color="green",shape="box"];2829[label="Integer (Neg vuz163) `quot` gcd0Gcd'0 (Integer (Pos (Succ (Succ vuz1650)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];2829 -> 2852[label="",style="solid", color="black", weight=3];
2830[label="Zero",fontsize=16,color="green",shape="box"];2831[label="Zero",fontsize=16,color="green",shape="box"];2832[label="Zero",fontsize=16,color="green",shape="box"];2833[label="Zero",fontsize=16,color="green",shape="box"];1576 -> 2713[label="",style="dashed", color="red", weight=0];
1576[label="primDivNatS0 (Succ vuz7200) (Succ vuz31000) (primGEqNatS vuz7200 vuz31000)",fontsize=16,color="magenta"];1576 -> 2714[label="",style="dashed", color="magenta", weight=3];
1576 -> 2715[label="",style="dashed", color="magenta", weight=3];
1576 -> 2716[label="",style="dashed", color="magenta", weight=3];
1576 -> 2717[label="",style="dashed", color="magenta", weight=3];
1577[label="primDivNatS0 (Succ vuz7200) Zero True",fontsize=16,color="black",shape="box"];1577 -> 1598[label="",style="solid", color="black", weight=3];
1578[label="primDivNatS0 Zero (Succ vuz31000) False",fontsize=16,color="black",shape="box"];1578 -> 1599[label="",style="solid", color="black", weight=3];
1579[label="primDivNatS0 Zero Zero True",fontsize=16,color="black",shape="box"];1579 -> 1600[label="",style="solid", color="black", weight=3];
3433[label="Integer (Pos vuz202) `quot` gcd0Gcd' (Integer (Pos (Succ (Succ vuz203)))) (Integer (Pos (Succ vuz204)) `rem` Integer (Pos (Succ (Succ vuz203))))",fontsize=16,color="black",shape="box"];3433 -> 3438[label="",style="solid", color="black", weight=3];
3439 -> 3380[label="",style="dashed", color="red", weight=0];
3439[label="Integer (Neg vuz216) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz217) vuz218 (primGEqNatS vuz2190 vuz2200))) (Pos Zero)) (Integer (Pos (Succ vuz218))) (Integer (Pos (primModNatS0 (Succ vuz217) vuz218 (primGEqNatS vuz2190 vuz2200))))",fontsize=16,color="magenta"];3439 -> 3444[label="",style="dashed", color="magenta", weight=3];
3439 -> 3445[label="",style="dashed", color="magenta", weight=3];
3440[label="Integer (Neg vuz216) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz217) vuz218 True)) (Pos Zero)) (Integer (Pos (Succ vuz218))) (Integer (Pos (primModNatS0 (Succ vuz217) vuz218 True)))",fontsize=16,color="black",shape="triangle"];3440 -> 3446[label="",style="solid", color="black", weight=3];
3441[label="Integer (Neg vuz216) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz217) vuz218 False)) (Pos Zero)) (Integer (Pos (Succ vuz218))) (Integer (Pos (primModNatS0 (Succ vuz217) vuz218 False)))",fontsize=16,color="black",shape="box"];3441 -> 3447[label="",style="solid", color="black", weight=3];
3442 -> 3440[label="",style="dashed", color="red", weight=0];
3442[label="Integer (Neg vuz216) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz217) vuz218 True)) (Pos Zero)) (Integer (Pos (Succ vuz218))) (Integer (Pos (primModNatS0 (Succ vuz217) vuz218 True)))",fontsize=16,color="magenta"];2852[label="Integer (Neg vuz163) `quot` gcd0Gcd' (Integer (Pos (Succ Zero))) (Integer (Pos (Succ (Succ vuz1650))) `rem` Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];2852 -> 2877[label="",style="solid", color="black", weight=3];
2714[label="vuz7200",fontsize=16,color="green",shape="box"];2715[label="vuz7200",fontsize=16,color="green",shape="box"];2716[label="vuz31000",fontsize=16,color="green",shape="box"];2717[label="vuz31000",fontsize=16,color="green",shape="box"];2713[label="primDivNatS0 (Succ vuz183) (Succ vuz184) (primGEqNatS vuz185 vuz186)",fontsize=16,color="burlywood",shape="triangle"];3648[label="vuz185/Succ vuz1850",fontsize=10,color="white",style="solid",shape="box"];2713 -> 3648[label="",style="solid", color="burlywood", weight=9];
3648 -> 2769[label="",style="solid", color="burlywood", weight=3];
3649[label="vuz185/Zero",fontsize=10,color="white",style="solid",shape="box"];2713 -> 3649[label="",style="solid", color="burlywood", weight=9];
3649 -> 2770[label="",style="solid", color="burlywood", weight=3];
1598[label="Succ (primDivNatS (primMinusNatS (Succ vuz7200) Zero) (Succ Zero))",fontsize=16,color="green",shape="box"];1598 -> 1623[label="",style="dashed", color="green", weight=3];
1599[label="Zero",fontsize=16,color="green",shape="box"];1600[label="Succ (primDivNatS (primMinusNatS Zero Zero) (Succ Zero))",fontsize=16,color="green",shape="box"];1600 -> 1624[label="",style="dashed", color="green", weight=3];
3438[label="Integer (Pos vuz202) `quot` gcd0Gcd'2 (Integer (Pos (Succ (Succ vuz203)))) (Integer (Pos (Succ vuz204)) `rem` Integer (Pos (Succ (Succ vuz203))))",fontsize=16,color="black",shape="box"];3438 -> 3443[label="",style="solid", color="black", weight=3];
3444[label="vuz2200",fontsize=16,color="green",shape="box"];3445[label="vuz2190",fontsize=16,color="green",shape="box"];3446 -> 2622[label="",style="dashed", color="red", weight=0];
3446[label="Integer (Neg vuz216) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (primMinusNatS (Succ vuz217) vuz218) (Succ vuz218))) (Pos Zero)) (Integer (Pos (Succ vuz218))) (Integer (Pos (primModNatS (primMinusNatS (Succ vuz217) vuz218) (Succ vuz218))))",fontsize=16,color="magenta"];3446 -> 3451[label="",style="dashed", color="magenta", weight=3];
3446 -> 3452[label="",style="dashed", color="magenta", weight=3];
3446 -> 3453[label="",style="dashed", color="magenta", weight=3];
3446 -> 3454[label="",style="dashed", color="magenta", weight=3];
3447[label="Integer (Neg vuz216) `quot` gcd0Gcd'1 (primEqInt (Pos (Succ (Succ vuz217))) (Pos Zero)) (Integer (Pos (Succ vuz218))) (Integer (Pos (Succ (Succ vuz217))))",fontsize=16,color="black",shape="box"];3447 -> 3455[label="",style="solid", color="black", weight=3];
2877[label="Integer (Neg vuz163) `quot` gcd0Gcd'2 (Integer (Pos (Succ Zero))) (Integer (Pos (Succ (Succ vuz1650))) `rem` Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];2877 -> 2907[label="",style="solid", color="black", weight=3];
2769[label="primDivNatS0 (Succ vuz183) (Succ vuz184) (primGEqNatS (Succ vuz1850) vuz186)",fontsize=16,color="burlywood",shape="box"];3651[label="vuz186/Succ vuz1860",fontsize=10,color="white",style="solid",shape="box"];2769 -> 3651[label="",style="solid", color="burlywood", weight=9];
3651 -> 2788[label="",style="solid", color="burlywood", weight=3];
3652[label="vuz186/Zero",fontsize=10,color="white",style="solid",shape="box"];2769 -> 3652[label="",style="solid", color="burlywood", weight=9];
3652 -> 2789[label="",style="solid", color="burlywood", weight=3];
2770[label="primDivNatS0 (Succ vuz183) (Succ vuz184) (primGEqNatS Zero vuz186)",fontsize=16,color="burlywood",shape="box"];3653[label="vuz186/Succ vuz1860",fontsize=10,color="white",style="solid",shape="box"];2770 -> 3653[label="",style="solid", color="burlywood", weight=9];
3653 -> 2790[label="",style="solid", color="burlywood", weight=3];
3654[label="vuz186/Zero",fontsize=10,color="white",style="solid",shape="box"];2770 -> 3654[label="",style="solid", color="burlywood", weight=9];
3654 -> 2791[label="",style="solid", color="burlywood", weight=3];
1623 -> 1493[label="",style="dashed", color="red", weight=0];
1623[label="primDivNatS (primMinusNatS (Succ vuz7200) Zero) (Succ Zero)",fontsize=16,color="magenta"];1623 -> 1649[label="",style="dashed", color="magenta", weight=3];
1623 -> 1650[label="",style="dashed", color="magenta", weight=3];
1624 -> 1493[label="",style="dashed", color="red", weight=0];
1624[label="primDivNatS (primMinusNatS Zero Zero) (Succ Zero)",fontsize=16,color="magenta"];1624 -> 1651[label="",style="dashed", color="magenta", weight=3];
1624 -> 1652[label="",style="dashed", color="magenta", weight=3];
3443 -> 1415[label="",style="dashed", color="red", weight=0];
3443[label="Integer (Pos vuz202) `quot` gcd0Gcd'1 (Integer (Pos (Succ vuz204)) `rem` Integer (Pos (Succ (Succ vuz203))) == fromInt (Pos Zero)) (Integer (Pos (Succ (Succ vuz203)))) (Integer (Pos (Succ vuz204)) `rem` Integer (Pos (Succ (Succ vuz203))))",fontsize=16,color="magenta"];3443 -> 3448[label="",style="dashed", color="magenta", weight=3];
3443 -> 3449[label="",style="dashed", color="magenta", weight=3];
3443 -> 3450[label="",style="dashed", color="magenta", weight=3];
3451 -> 2226[label="",style="dashed", color="red", weight=0];
3451[label="primMinusNatS (Succ vuz217) vuz218",fontsize=16,color="magenta"];3451 -> 3456[label="",style="dashed", color="magenta", weight=3];
3451 -> 3457[label="",style="dashed", color="magenta", weight=3];
3452 -> 2226[label="",style="dashed", color="red", weight=0];
3452[label="primMinusNatS (Succ vuz217) vuz218",fontsize=16,color="magenta"];3452 -> 3458[label="",style="dashed", color="magenta", weight=3];
3452 -> 3459[label="",style="dashed", color="magenta", weight=3];
3453[label="vuz216",fontsize=16,color="green",shape="box"];3454[label="vuz218",fontsize=16,color="green",shape="box"];3455[label="Integer (Neg vuz216) `quot` gcd0Gcd'1 False (Integer (Pos (Succ vuz218))) (Integer (Pos (Succ (Succ vuz217))))",fontsize=16,color="black",shape="box"];3455 -> 3460[label="",style="solid", color="black", weight=3];
2907[label="Integer (Neg vuz163) `quot` gcd0Gcd'1 (Integer (Pos (Succ (Succ vuz1650))) `rem` Integer (Pos (Succ Zero)) == fromInt (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (Succ (Succ vuz1650))) `rem` Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];2907 -> 2927[label="",style="solid", color="black", weight=3];
2788[label="primDivNatS0 (Succ vuz183) (Succ vuz184) (primGEqNatS (Succ vuz1850) (Succ vuz1860))",fontsize=16,color="black",shape="box"];2788 -> 2817[label="",style="solid", color="black", weight=3];
2789[label="primDivNatS0 (Succ vuz183) (Succ vuz184) (primGEqNatS (Succ vuz1850) Zero)",fontsize=16,color="black",shape="box"];2789 -> 2818[label="",style="solid", color="black", weight=3];
2790[label="primDivNatS0 (Succ vuz183) (Succ vuz184) (primGEqNatS Zero (Succ vuz1860))",fontsize=16,color="black",shape="box"];2790 -> 2819[label="",style="solid", color="black", weight=3];
2791[label="primDivNatS0 (Succ vuz183) (Succ vuz184) (primGEqNatS Zero Zero)",fontsize=16,color="black",shape="box"];2791 -> 2820[label="",style="solid", color="black", weight=3];
1649[label="primMinusNatS (Succ vuz7200) Zero",fontsize=16,color="black",shape="triangle"];1649 -> 1679[label="",style="solid", color="black", weight=3];
1650[label="Zero",fontsize=16,color="green",shape="box"];1651[label="primMinusNatS Zero Zero",fontsize=16,color="black",shape="triangle"];1651 -> 1680[label="",style="solid", color="black", weight=3];
1652[label="Zero",fontsize=16,color="green",shape="box"];3448[label="vuz204",fontsize=16,color="green",shape="box"];3449[label="vuz202",fontsize=16,color="green",shape="box"];3450[label="Succ vuz203",fontsize=16,color="green",shape="box"];3456[label="vuz218",fontsize=16,color="green",shape="box"];3457[label="Succ vuz217",fontsize=16,color="green",shape="box"];3458[label="vuz218",fontsize=16,color="green",shape="box"];3459[label="Succ vuz217",fontsize=16,color="green",shape="box"];3460[label="Integer (Neg vuz216) `quot` gcd0Gcd'0 (Integer (Pos (Succ vuz218))) (Integer (Pos (Succ (Succ vuz217))))",fontsize=16,color="black",shape="box"];3460 -> 3461[label="",style="solid", color="black", weight=3];
2927[label="Integer (Neg vuz163) `quot` gcd0Gcd'1 (Integer (primRemInt (Pos (Succ (Succ vuz1650))) (Pos (Succ Zero))) == fromInt (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (primRemInt (Pos (Succ (Succ vuz1650))) (Pos (Succ Zero))))",fontsize=16,color="black",shape="box"];2927 -> 2950[label="",style="solid", color="black", weight=3];
2817 -> 2713[label="",style="dashed", color="red", weight=0];
2817[label="primDivNatS0 (Succ vuz183) (Succ vuz184) (primGEqNatS vuz1850 vuz1860)",fontsize=16,color="magenta"];2817 -> 2843[label="",style="dashed", color="magenta", weight=3];
2817 -> 2844[label="",style="dashed", color="magenta", weight=3];
2818[label="primDivNatS0 (Succ vuz183) (Succ vuz184) True",fontsize=16,color="black",shape="triangle"];2818 -> 2845[label="",style="solid", color="black", weight=3];
2819[label="primDivNatS0 (Succ vuz183) (Succ vuz184) False",fontsize=16,color="black",shape="box"];2819 -> 2846[label="",style="solid", color="black", weight=3];
2820 -> 2818[label="",style="dashed", color="red", weight=0];
2820[label="primDivNatS0 (Succ vuz183) (Succ vuz184) True",fontsize=16,color="magenta"];1679[label="Succ vuz7200",fontsize=16,color="green",shape="box"];1680[label="Zero",fontsize=16,color="green",shape="box"];3461[label="Integer (Neg vuz216) `quot` gcd0Gcd' (Integer (Pos (Succ (Succ vuz217)))) (Integer (Pos (Succ vuz218)) `rem` Integer (Pos (Succ (Succ vuz217))))",fontsize=16,color="black",shape="box"];3461 -> 3462[label="",style="solid", color="black", weight=3];
2950[label="Integer (Neg vuz163) `quot` gcd0Gcd'1 (Integer (primRemInt (Pos (Succ (Succ vuz1650))) (Pos (Succ Zero))) == Integer (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (primRemInt (Pos (Succ (Succ vuz1650))) (Pos (Succ Zero))))",fontsize=16,color="black",shape="box"];2950 -> 2979[label="",style="solid", color="black", weight=3];
2843[label="vuz1850",fontsize=16,color="green",shape="box"];2844[label="vuz1860",fontsize=16,color="green",shape="box"];2845[label="Succ (primDivNatS (primMinusNatS (Succ vuz183) (Succ vuz184)) (Succ (Succ vuz184)))",fontsize=16,color="green",shape="box"];2845 -> 2865[label="",style="dashed", color="green", weight=3];
2846[label="Zero",fontsize=16,color="green",shape="box"];3462[label="Integer (Neg vuz216) `quot` gcd0Gcd'2 (Integer (Pos (Succ (Succ vuz217)))) (Integer (Pos (Succ vuz218)) `rem` Integer (Pos (Succ (Succ vuz217))))",fontsize=16,color="black",shape="box"];3462 -> 3463[label="",style="solid", color="black", weight=3];
2979 -> 1456[label="",style="dashed", color="red", weight=0];
2979[label="Integer (Neg vuz163) `quot` gcd0Gcd'1 (primEqInt (primRemInt (Pos (Succ (Succ vuz1650))) (Pos (Succ Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (primRemInt (Pos (Succ (Succ vuz1650))) (Pos (Succ Zero))))",fontsize=16,color="magenta"];2979 -> 3000[label="",style="dashed", color="magenta", weight=3];
2979 -> 3001[label="",style="dashed", color="magenta", weight=3];
2979 -> 3002[label="",style="dashed", color="magenta", weight=3];
2865 -> 1493[label="",style="dashed", color="red", weight=0];
2865[label="primDivNatS (primMinusNatS (Succ vuz183) (Succ vuz184)) (Succ (Succ vuz184))",fontsize=16,color="magenta"];2865 -> 2892[label="",style="dashed", color="magenta", weight=3];
2865 -> 2893[label="",style="dashed", color="magenta", weight=3];
3463[label="Integer (Neg vuz216) `quot` gcd0Gcd'1 (Integer (Pos (Succ vuz218)) `rem` Integer (Pos (Succ (Succ vuz217))) == fromInt (Pos Zero)) (Integer (Pos (Succ (Succ vuz217)))) (Integer (Pos (Succ vuz218)) `rem` Integer (Pos (Succ (Succ vuz217))))",fontsize=16,color="black",shape="box"];3463 -> 3464[label="",style="solid", color="black", weight=3];
3000[label="Succ vuz1650",fontsize=16,color="green",shape="box"];3001[label="Zero",fontsize=16,color="green",shape="box"];3002[label="vuz163",fontsize=16,color="green",shape="box"];2892 -> 2226[label="",style="dashed", color="red", weight=0];
2892[label="primMinusNatS (Succ vuz183) (Succ vuz184)",fontsize=16,color="magenta"];2892 -> 2917[label="",style="dashed", color="magenta", weight=3];
2892 -> 2918[label="",style="dashed", color="magenta", weight=3];
2893[label="Succ vuz184",fontsize=16,color="green",shape="box"];3464[label="Integer (Neg vuz216) `quot` gcd0Gcd'1 (Integer (primRemInt (Pos (Succ vuz218)) (Pos (Succ (Succ vuz217)))) == fromInt (Pos Zero)) (Integer (Pos (Succ (Succ vuz217)))) (Integer (primRemInt (Pos (Succ vuz218)) (Pos (Succ (Succ vuz217)))))",fontsize=16,color="black",shape="box"];3464 -> 3465[label="",style="solid", color="black", weight=3];
2917[label="Succ vuz184",fontsize=16,color="green",shape="box"];2918[label="Succ vuz183",fontsize=16,color="green",shape="box"];3465[label="Integer (Neg vuz216) `quot` gcd0Gcd'1 (Integer (primRemInt (Pos (Succ vuz218)) (Pos (Succ (Succ vuz217)))) == Integer (Pos Zero)) (Integer (Pos (Succ (Succ vuz217)))) (Integer (primRemInt (Pos (Succ vuz218)) (Pos (Succ (Succ vuz217)))))",fontsize=16,color="black",shape="box"];3465 -> 3466[label="",style="solid", color="black", weight=3];
3466 -> 1456[label="",style="dashed", color="red", weight=0];
3466[label="Integer (Neg vuz216) `quot` gcd0Gcd'1 (primEqInt (primRemInt (Pos (Succ vuz218)) (Pos (Succ (Succ vuz217)))) (Pos Zero)) (Integer (Pos (Succ (Succ vuz217)))) (Integer (primRemInt (Pos (Succ vuz218)) (Pos (Succ (Succ vuz217)))))",fontsize=16,color="magenta"];3466 -> 3467[label="",style="dashed", color="magenta", weight=3];
3466 -> 3468[label="",style="dashed", color="magenta", weight=3];
3466 -> 3469[label="",style="dashed", color="magenta", weight=3];
3467[label="vuz218",fontsize=16,color="green",shape="box"];3468[label="Succ vuz217",fontsize=16,color="green",shape="box"];3469[label="vuz216",fontsize=16,color="green",shape="box"];}

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                            ↳ QDPSizeChangeProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_primMulNat(Succ(vuz30000)) → new_primMulNat(vuz30000)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:

new_primMulNat(Succ(vuz30000)) → new_primMulNat(vuz30000)
The graph contains the following edges 1 > 1

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                            ↳ QDPSizeChangeProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_primMinusNatS(Succ(vuz13000), Succ(vuz1310)) → new_primMinusNatS(vuz13000, vuz1310)

From the DPs we obtained the following set of size-change graphs:

new_primMinusNatS(Succ(vuz13000), Succ(vuz1310)) → new_primMinusNatS(vuz13000, vuz1310)
The graph contains the following edges 1 > 1, 2 > 2

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_primDivNatS0(vuz183, vuz184, Zero, Zero) → new_primDivNatS00(vuz183, vuz184)
new_primDivNatS(Succ(Succ(vuz7200)), Succ(vuz31000)) → new_primDivNatS0(vuz7200, vuz31000, vuz7200, vuz31000)
new_primDivNatS0(vuz183, vuz184, Succ(vuz1850), Succ(vuz1860)) → new_primDivNatS0(vuz183, vuz184, vuz1850, vuz1860)
new_primDivNatS00(vuz183, vuz184) → new_primDivNatS(new_primMinusNatS2(Succ(vuz183), Succ(vuz184)), Succ(vuz184))
new_primDivNatS(Succ(Succ(vuz7200)), Zero) → new_primDivNatS(new_primMinusNatS0(vuz7200), Zero)
new_primDivNatS0(vuz183, vuz184, Succ(vuz1850), Zero) → new_primDivNatS(new_primMinusNatS2(Succ(vuz183), Succ(vuz184)), Succ(vuz184))
new_primDivNatS(Succ(Zero), Zero) → new_primDivNatS(new_primMinusNatS1, Zero)

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz13000), Succ(vuz1310)) → new_primMinusNatS2(vuz13000, vuz1310)
new_primMinusNatS2(Zero, Succ(vuz1310)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz13000), Zero) → Succ(vuz13000)
new_primMinusNatS1 → Zero
new_primMinusNatS0(vuz7200) → Succ(vuz7200)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS1
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS0(x0)

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 2 SCCs with 1 less node.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                  ↳ UsableRulesProof

                                ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_primDivNatS(Succ(Succ(vuz7200)), Zero) → new_primDivNatS(new_primMinusNatS0(vuz7200), Zero)

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz13000), Succ(vuz1310)) → new_primMinusNatS2(vuz13000, vuz1310)
new_primMinusNatS2(Zero, Succ(vuz1310)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz13000), Zero) → Succ(vuz13000)
new_primMinusNatS1 → Zero
new_primMinusNatS0(vuz7200) → Succ(vuz7200)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS1
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS0(x0)

We have to consider all minimal (P,Q,R)-chains.
As all Q-normal forms are R-normal forms we are in the innermost case. Hence, by the usable rules processor [15] we can delete all non-usable rules [17] from R.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                  ↳ UsableRulesProof

                                    ↳ QDP

                                      ↳ QReductionProof

                                ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_primDivNatS(Succ(Succ(vuz7200)), Zero) → new_primDivNatS(new_primMinusNatS0(vuz7200), Zero)

The TRS R consists of the following rules:

new_primMinusNatS0(vuz7200) → Succ(vuz7200)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS1
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS0(x0)

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS1
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Succ(x0))

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                  ↳ UsableRulesProof

                                    ↳ QDP

                                      ↳ QReductionProof

                                        ↳ QDP

                                          ↳ RuleRemovalProof

                                ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_primDivNatS(Succ(Succ(vuz7200)), Zero) → new_primDivNatS(new_primMinusNatS0(vuz7200), Zero)

The TRS R consists of the following rules:

new_primMinusNatS0(vuz7200) → Succ(vuz7200)

The set Q consists of the following terms:

new_primMinusNatS0(x0)

We have to consider all minimal (P,Q,R)-chains.
By using the rule removal processor [15] with the following polynomial ordering [25], at least one Dependency Pair or term rewrite system rule of this QDP problem can be strictly oriented.
Strictly oriented dependency pairs:

new_primDivNatS(Succ(Succ(vuz7200)), Zero) → new_primDivNatS(new_primMinusNatS0(vuz7200), Zero)

Strictly oriented rules of the TRS R:

new_primMinusNatS0(vuz7200) → Succ(vuz7200)

Used ordering: POLO with Polynomial interpretation [25]:

POL(Succ(x₁)) = 1 + 2·x₁
POL(Zero) = 0
POL(new_primDivNatS(x₁, x₂)) = x₁ + x₂
POL(new_primMinusNatS0(x₁)) = 2 + 2·x₁

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                  ↳ UsableRulesProof

                                    ↳ QDP

                                      ↳ QReductionProof

                                        ↳ QDP

                                          ↳ RuleRemovalProof

                                            ↳ QDP

                                              ↳ PisEmptyProof

                                ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
P is empty.
R is empty.
The set Q consists of the following terms:

new_primMinusNatS0(x0)

We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                ↳ QDP

                                  ↳ UsableRulesProof

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_primDivNatS0(vuz183, vuz184, Zero, Zero) → new_primDivNatS00(vuz183, vuz184)
new_primDivNatS0(vuz183, vuz184, Succ(vuz1850), Succ(vuz1860)) → new_primDivNatS0(vuz183, vuz184, vuz1850, vuz1860)
new_primDivNatS(Succ(Succ(vuz7200)), Succ(vuz31000)) → new_primDivNatS0(vuz7200, vuz31000, vuz7200, vuz31000)
new_primDivNatS00(vuz183, vuz184) → new_primDivNatS(new_primMinusNatS2(Succ(vuz183), Succ(vuz184)), Succ(vuz184))
new_primDivNatS0(vuz183, vuz184, Succ(vuz1850), Zero) → new_primDivNatS(new_primMinusNatS2(Succ(vuz183), Succ(vuz184)), Succ(vuz184))

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz13000), Succ(vuz1310)) → new_primMinusNatS2(vuz13000, vuz1310)
new_primMinusNatS2(Zero, Succ(vuz1310)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz13000), Zero) → Succ(vuz13000)
new_primMinusNatS1 → Zero
new_primMinusNatS0(vuz7200) → Succ(vuz7200)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS1
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS0(x0)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                ↳ QDP

                                  ↳ UsableRulesProof

                                    ↳ QDP

                                      ↳ QReductionProof

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_primDivNatS0(vuz183, vuz184, Zero, Zero) → new_primDivNatS00(vuz183, vuz184)
new_primDivNatS0(vuz183, vuz184, Succ(vuz1850), Succ(vuz1860)) → new_primDivNatS0(vuz183, vuz184, vuz1850, vuz1860)
new_primDivNatS(Succ(Succ(vuz7200)), Succ(vuz31000)) → new_primDivNatS0(vuz7200, vuz31000, vuz7200, vuz31000)
new_primDivNatS00(vuz183, vuz184) → new_primDivNatS(new_primMinusNatS2(Succ(vuz183), Succ(vuz184)), Succ(vuz184))
new_primDivNatS0(vuz183, vuz184, Succ(vuz1850), Zero) → new_primDivNatS(new_primMinusNatS2(Succ(vuz183), Succ(vuz184)), Succ(vuz184))

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz13000), Succ(vuz1310)) → new_primMinusNatS2(vuz13000, vuz1310)
new_primMinusNatS2(Zero, Succ(vuz1310)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz13000), Zero) → Succ(vuz13000)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS1
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS0(x0)

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_primMinusNatS1
new_primMinusNatS0(x0)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                ↳ QDP

                                  ↳ UsableRulesProof

                                    ↳ QDP

                                      ↳ QReductionProof

                                        ↳ QDP

                                          ↳ Rewriting

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_primDivNatS0(vuz183, vuz184, Zero, Zero) → new_primDivNatS00(vuz183, vuz184)
new_primDivNatS(Succ(Succ(vuz7200)), Succ(vuz31000)) → new_primDivNatS0(vuz7200, vuz31000, vuz7200, vuz31000)
new_primDivNatS0(vuz183, vuz184, Succ(vuz1850), Succ(vuz1860)) → new_primDivNatS0(vuz183, vuz184, vuz1850, vuz1860)
new_primDivNatS00(vuz183, vuz184) → new_primDivNatS(new_primMinusNatS2(Succ(vuz183), Succ(vuz184)), Succ(vuz184))
new_primDivNatS0(vuz183, vuz184, Succ(vuz1850), Zero) → new_primDivNatS(new_primMinusNatS2(Succ(vuz183), Succ(vuz184)), Succ(vuz184))

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz13000), Succ(vuz1310)) → new_primMinusNatS2(vuz13000, vuz1310)
new_primMinusNatS2(Zero, Succ(vuz1310)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz13000), Zero) → Succ(vuz13000)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Succ(x0))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_primDivNatS00(vuz183, vuz184) → new_primDivNatS(new_primMinusNatS2(Succ(vuz183), Succ(vuz184)), Succ(vuz184)) at position [0] we obtained the following new rules:

new_primDivNatS00(vuz183, vuz184) → new_primDivNatS(new_primMinusNatS2(vuz183, vuz184), Succ(vuz184))

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                ↳ QDP

                                  ↳ UsableRulesProof

                                    ↳ QDP

                                      ↳ QReductionProof

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_primDivNatS0(vuz183, vuz184, Zero, Zero) → new_primDivNatS00(vuz183, vuz184)
new_primDivNatS0(vuz183, vuz184, Succ(vuz1850), Succ(vuz1860)) → new_primDivNatS0(vuz183, vuz184, vuz1850, vuz1860)
new_primDivNatS(Succ(Succ(vuz7200)), Succ(vuz31000)) → new_primDivNatS0(vuz7200, vuz31000, vuz7200, vuz31000)
new_primDivNatS00(vuz183, vuz184) → new_primDivNatS(new_primMinusNatS2(vuz183, vuz184), Succ(vuz184))
new_primDivNatS0(vuz183, vuz184, Succ(vuz1850), Zero) → new_primDivNatS(new_primMinusNatS2(Succ(vuz183), Succ(vuz184)), Succ(vuz184))

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz13000), Succ(vuz1310)) → new_primMinusNatS2(vuz13000, vuz1310)
new_primMinusNatS2(Zero, Succ(vuz1310)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz13000), Zero) → Succ(vuz13000)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Succ(x0))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_primDivNatS0(vuz183, vuz184, Succ(vuz1850), Zero) → new_primDivNatS(new_primMinusNatS2(Succ(vuz183), Succ(vuz184)), Succ(vuz184)) at position [0] we obtained the following new rules:

new_primDivNatS0(vuz183, vuz184, Succ(vuz1850), Zero) → new_primDivNatS(new_primMinusNatS2(vuz183, vuz184), Succ(vuz184))

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                ↳ QDP

                                  ↳ UsableRulesProof

                                    ↳ QDP

                                      ↳ QReductionProof

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ QDPOrderProof

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_primDivNatS0(vuz183, vuz184, Zero, Zero) → new_primDivNatS00(vuz183, vuz184)
new_primDivNatS0(vuz183, vuz184, Succ(vuz1850), Zero) → new_primDivNatS(new_primMinusNatS2(vuz183, vuz184), Succ(vuz184))
new_primDivNatS(Succ(Succ(vuz7200)), Succ(vuz31000)) → new_primDivNatS0(vuz7200, vuz31000, vuz7200, vuz31000)
new_primDivNatS0(vuz183, vuz184, Succ(vuz1850), Succ(vuz1860)) → new_primDivNatS0(vuz183, vuz184, vuz1850, vuz1860)
new_primDivNatS00(vuz183, vuz184) → new_primDivNatS(new_primMinusNatS2(vuz183, vuz184), Succ(vuz184))

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz13000), Succ(vuz1310)) → new_primMinusNatS2(vuz13000, vuz1310)
new_primMinusNatS2(Zero, Succ(vuz1310)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz13000), Zero) → Succ(vuz13000)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Succ(x0))

We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

new_primDivNatS0(vuz183, vuz184, Succ(vuz1850), Zero) → new_primDivNatS(new_primMinusNatS2(vuz183, vuz184), Succ(vuz184))
new_primDivNatS(Succ(Succ(vuz7200)), Succ(vuz31000)) → new_primDivNatS0(vuz7200, vuz31000, vuz7200, vuz31000)
new_primDivNatS00(vuz183, vuz184) → new_primDivNatS(new_primMinusNatS2(vuz183, vuz184), Succ(vuz184))

The remaining pairs can at least be oriented weakly.

new_primDivNatS0(vuz183, vuz184, Zero, Zero) → new_primDivNatS00(vuz183, vuz184)
new_primDivNatS0(vuz183, vuz184, Succ(vuz1850), Succ(vuz1860)) → new_primDivNatS0(vuz183, vuz184, vuz1850, vuz1860)

Used ordering: Polynomial interpretation [25]:

POL(Succ(x₁)) = 1 + x₁
POL(Zero) = 0
POL(new_primDivNatS(x₁, x₂)) = x₁
POL(new_primDivNatS0(x₁, x₂, x₃, x₄)) = 1 + x₁
POL(new_primDivNatS00(x₁, x₂)) = 1 + x₁
POL(new_primMinusNatS2(x₁, x₂)) = x₁

The following usable rules [17] were oriented:

new_primMinusNatS2(Zero, Succ(vuz1310)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz13000), Succ(vuz1310)) → new_primMinusNatS2(vuz13000, vuz1310)
new_primMinusNatS2(Succ(vuz13000), Zero) → Succ(vuz13000)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                ↳ QDP

                                  ↳ UsableRulesProof

                                    ↳ QDP

                                      ↳ QReductionProof

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ QDPOrderProof

                                                    ↳ QDP

                                                      ↳ DependencyGraphProof

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_primDivNatS0(vuz183, vuz184, Zero, Zero) → new_primDivNatS00(vuz183, vuz184)
new_primDivNatS0(vuz183, vuz184, Succ(vuz1850), Succ(vuz1860)) → new_primDivNatS0(vuz183, vuz184, vuz1850, vuz1860)

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz13000), Succ(vuz1310)) → new_primMinusNatS2(vuz13000, vuz1310)
new_primMinusNatS2(Zero, Succ(vuz1310)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz13000), Zero) → Succ(vuz13000)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Succ(x0))

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 1 less node.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                ↳ QDP

                                  ↳ UsableRulesProof

                                    ↳ QDP

                                      ↳ QReductionProof

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ QDPOrderProof

                                                    ↳ QDP

                                                      ↳ DependencyGraphProof

                                                        ↳ QDP

                                                          ↳ UsableRulesProof

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_primDivNatS0(vuz183, vuz184, Succ(vuz1850), Succ(vuz1860)) → new_primDivNatS0(vuz183, vuz184, vuz1850, vuz1860)

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz13000), Succ(vuz1310)) → new_primMinusNatS2(vuz13000, vuz1310)
new_primMinusNatS2(Zero, Succ(vuz1310)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz13000), Zero) → Succ(vuz13000)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Succ(x0))

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                ↳ QDP

                                  ↳ UsableRulesProof

                                    ↳ QDP

                                      ↳ QReductionProof

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ QDPOrderProof

                                                    ↳ QDP

                                                      ↳ DependencyGraphProof

                                                        ↳ QDP

                                                          ↳ UsableRulesProof

                                                            ↳ QDP

                                                              ↳ QReductionProof

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_primDivNatS0(vuz183, vuz184, Succ(vuz1850), Succ(vuz1860)) → new_primDivNatS0(vuz183, vuz184, vuz1850, vuz1860)

R is empty.
The set Q consists of the following terms:

new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Succ(x0))

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Succ(x0))

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                ↳ QDP

                                  ↳ UsableRulesProof

                                    ↳ QDP

                                      ↳ QReductionProof

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ QDPOrderProof

                                                    ↳ QDP

                                                      ↳ DependencyGraphProof

                                                        ↳ QDP

                                                          ↳ UsableRulesProof

                                                            ↳ QDP

                                                              ↳ QReductionProof

                                                                ↳ QDP

                                                                  ↳ QDPSizeChangeProof

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_primDivNatS0(vuz183, vuz184, Succ(vuz1850), Succ(vuz1860)) → new_primDivNatS0(vuz183, vuz184, vuz1850, vuz1860)

From the DPs we obtained the following set of size-change graphs:

new_primDivNatS0(vuz183, vuz184, Succ(vuz1850), Succ(vuz1860)) → new_primDivNatS0(vuz183, vuz184, vuz1850, vuz1860)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 > 3, 4 > 4

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot0(vuz163, Succ(Succ(vuz17300)), Succ(vuz1650), vuz172) → new_quot(vuz163, vuz17300, Succ(vuz1650), vuz17300, vuz1650)
new_quot0(vuz163, Succ(Succ(vuz17300)), Zero, vuz172) → new_quot0(vuz163, new_primMinusNatS2(Succ(vuz17300), Zero), Zero, new_primMinusNatS2(Succ(vuz17300), Zero))
new_quot0(vuz163, Succ(Zero), Zero, vuz172) → new_quot0(vuz163, new_primMinusNatS2(Zero, Zero), Zero, new_primMinusNatS2(Zero, Zero))
new_quot(vuz216, vuz217, vuz218, Zero, Succ(vuz2200)) → new_quot1(vuz216, vuz218, Succ(vuz217))
new_quot2(vuz216, vuz217, vuz218) → new_quot0(vuz216, new_primMinusNatS2(Succ(vuz217), vuz218), vuz218, new_primMinusNatS2(Succ(vuz217), vuz218))
new_quot(vuz216, vuz217, vuz218, Succ(vuz2190), Succ(vuz2200)) → new_quot(vuz216, vuz217, vuz218, vuz2190, vuz2200)
new_quot(vuz216, vuz217, vuz218, Succ(vuz2190), Zero) → new_quot0(vuz216, new_primMinusNatS2(Succ(vuz217), vuz218), vuz218, new_primMinusNatS2(Succ(vuz217), vuz218))
new_quot1(vuz81, vuz820, vuz3100) → new_quot3(vuz81, vuz820, vuz3100)
new_quot0(vuz163, Succ(Zero), Succ(vuz1650), vuz172) → new_quot1(vuz163, Succ(vuz1650), Zero)
new_quot3(vuz81, vuz820, vuz3100) → new_quot3(vuz81, vuz820, vuz3100)
new_quot(vuz216, vuz217, vuz218, Zero, Zero) → new_quot2(vuz216, vuz217, vuz218)

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz13000), Succ(vuz1310)) → new_primMinusNatS2(vuz13000, vuz1310)
new_primMinusNatS2(Zero, Succ(vuz1310)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz13000), Zero) → Succ(vuz13000)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Succ(x0))

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 3 SCCs with 4 less nodes.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                  ↳ UsableRulesProof

                                ↳ QDP

                                ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot3(vuz81, vuz820, vuz3100) → new_quot3(vuz81, vuz820, vuz3100)

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz13000), Succ(vuz1310)) → new_primMinusNatS2(vuz13000, vuz1310)
new_primMinusNatS2(Zero, Succ(vuz1310)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz13000), Zero) → Succ(vuz13000)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Succ(x0))

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                  ↳ UsableRulesProof

                                    ↳ QDP

                                      ↳ QReductionProof

                                ↳ QDP

                                ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot3(vuz81, vuz820, vuz3100) → new_quot3(vuz81, vuz820, vuz3100)

R is empty.
The set Q consists of the following terms:

new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Succ(x0))

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Succ(x0))

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                  ↳ UsableRulesProof

                                    ↳ QDP

                                      ↳ QReductionProof

                                        ↳ QDP

                                          ↳ NonTerminationProof

                                ↳ QDP

                                ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot3(vuz81, vuz820, vuz3100) → new_quot3(vuz81, vuz820, vuz3100)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We used the non-termination processor [17] to show that the DP problem is infinite.
Found a loop by semiunifying a rule from P directly.

The TRS P consists of the following rules:

new_quot3(vuz81, vuz820, vuz3100) → new_quot3(vuz81, vuz820, vuz3100)

The TRS R consists of the following rules:none

s = new_quot3(vuz81, vuz820, vuz3100) evaluates to t =new_quot3(vuz81, vuz820, vuz3100)

Thus s starts an infinite chain as s semiunifies with t with the following substitutions:

Semiunifier: [ ]
Matcher: [ ]

Rewriting sequence

The DP semiunifies directly so there is only one rewrite step from new_quot3(vuz81, vuz820, vuz3100) to new_quot3(vuz81, vuz820, vuz3100).

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                ↳ QDP

                                  ↳ UsableRulesProof

                                ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot0(vuz163, Succ(Succ(vuz17300)), Zero, vuz172) → new_quot0(vuz163, new_primMinusNatS2(Succ(vuz17300), Zero), Zero, new_primMinusNatS2(Succ(vuz17300), Zero))

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz13000), Succ(vuz1310)) → new_primMinusNatS2(vuz13000, vuz1310)
new_primMinusNatS2(Zero, Succ(vuz1310)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz13000), Zero) → Succ(vuz13000)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Succ(x0))

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                ↳ QDP

                                  ↳ UsableRulesProof

                                    ↳ QDP

                                      ↳ RuleRemovalProof

                                ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot0(vuz163, Succ(Succ(vuz17300)), Zero, vuz172) → new_quot0(vuz163, new_primMinusNatS2(Succ(vuz17300), Zero), Zero, new_primMinusNatS2(Succ(vuz17300), Zero))

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz13000), Zero) → Succ(vuz13000)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Succ(x0))

new_quot0(vuz163, Succ(Succ(vuz17300)), Zero, vuz172) → new_quot0(vuz163, new_primMinusNatS2(Succ(vuz17300), Zero), Zero, new_primMinusNatS2(Succ(vuz17300), Zero))

Used ordering: POLO with Polynomial interpretation [25]:

POL(Succ(x₁)) = 1 + 2·x₁
POL(Zero) = 0
POL(new_primMinusNatS2(x₁, x₂)) = x₁ + 2·x₂
POL(new_quot0(x₁, x₂, x₃, x₄)) = x₁ + x₂ + x₃ + x₄

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                ↳ QDP

                                  ↳ UsableRulesProof

                                    ↳ QDP

                                      ↳ RuleRemovalProof

                                        ↳ QDP

                                          ↳ PisEmptyProof

                                ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
P is empty.
The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz13000), Zero) → Succ(vuz13000)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Succ(x0))

We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                ↳ QDP

                                ↳ QDP

                                  ↳ QDPOrderProof

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot0(vuz163, Succ(Succ(vuz17300)), Succ(vuz1650), vuz172) → new_quot(vuz163, vuz17300, Succ(vuz1650), vuz17300, vuz1650)
new_quot2(vuz216, vuz217, vuz218) → new_quot0(vuz216, new_primMinusNatS2(Succ(vuz217), vuz218), vuz218, new_primMinusNatS2(Succ(vuz217), vuz218))
new_quot(vuz216, vuz217, vuz218, Succ(vuz2190), Succ(vuz2200)) → new_quot(vuz216, vuz217, vuz218, vuz2190, vuz2200)
new_quot(vuz216, vuz217, vuz218, Succ(vuz2190), Zero) → new_quot0(vuz216, new_primMinusNatS2(Succ(vuz217), vuz218), vuz218, new_primMinusNatS2(Succ(vuz217), vuz218))
new_quot(vuz216, vuz217, vuz218, Zero, Zero) → new_quot2(vuz216, vuz217, vuz218)

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz13000), Succ(vuz1310)) → new_primMinusNatS2(vuz13000, vuz1310)
new_primMinusNatS2(Zero, Succ(vuz1310)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz13000), Zero) → Succ(vuz13000)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Succ(x0))

We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

new_quot0(vuz163, Succ(Succ(vuz17300)), Succ(vuz1650), vuz172) → new_quot(vuz163, vuz17300, Succ(vuz1650), vuz17300, vuz1650)

The remaining pairs can at least be oriented weakly.

new_quot2(vuz216, vuz217, vuz218) → new_quot0(vuz216, new_primMinusNatS2(Succ(vuz217), vuz218), vuz218, new_primMinusNatS2(Succ(vuz217), vuz218))
new_quot(vuz216, vuz217, vuz218, Succ(vuz2190), Succ(vuz2200)) → new_quot(vuz216, vuz217, vuz218, vuz2190, vuz2200)
new_quot(vuz216, vuz217, vuz218, Succ(vuz2190), Zero) → new_quot0(vuz216, new_primMinusNatS2(Succ(vuz217), vuz218), vuz218, new_primMinusNatS2(Succ(vuz217), vuz218))
new_quot(vuz216, vuz217, vuz218, Zero, Zero) → new_quot2(vuz216, vuz217, vuz218)

Used ordering: Polynomial interpretation [25]:

POL(Succ(x₁)) = 1 + x₁
POL(Zero) = 0
POL(new_primMinusNatS2(x₁, x₂)) = x₁
POL(new_quot(x₁, x₂, x₃, x₄, x₅)) = 1 + x₂ + x₃
POL(new_quot0(x₁, x₂, x₃, x₄)) = x₂ + x₃
POL(new_quot2(x₁, x₂, x₃)) = 1 + x₂ + x₃

The following usable rules [17] were oriented:

new_primMinusNatS2(Succ(vuz13000), Zero) → Succ(vuz13000)
new_primMinusNatS2(Zero, Succ(vuz1310)) → Zero
new_primMinusNatS2(Succ(vuz13000), Succ(vuz1310)) → new_primMinusNatS2(vuz13000, vuz1310)
new_primMinusNatS2(Zero, Zero) → Zero

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                ↳ QDP

                                ↳ QDP

                                  ↳ QDPOrderProof

                                    ↳ QDP

                                      ↳ DependencyGraphProof

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot2(vuz216, vuz217, vuz218) → new_quot0(vuz216, new_primMinusNatS2(Succ(vuz217), vuz218), vuz218, new_primMinusNatS2(Succ(vuz217), vuz218))
new_quot(vuz216, vuz217, vuz218, Succ(vuz2190), Zero) → new_quot0(vuz216, new_primMinusNatS2(Succ(vuz217), vuz218), vuz218, new_primMinusNatS2(Succ(vuz217), vuz218))
new_quot(vuz216, vuz217, vuz218, Succ(vuz2190), Succ(vuz2200)) → new_quot(vuz216, vuz217, vuz218, vuz2190, vuz2200)
new_quot(vuz216, vuz217, vuz218, Zero, Zero) → new_quot2(vuz216, vuz217, vuz218)

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz13000), Succ(vuz1310)) → new_primMinusNatS2(vuz13000, vuz1310)
new_primMinusNatS2(Zero, Succ(vuz1310)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz13000), Zero) → Succ(vuz13000)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Succ(x0))

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 3 less nodes.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                ↳ QDP

                                ↳ QDP

                                  ↳ QDPOrderProof

                                    ↳ QDP

                                      ↳ DependencyGraphProof

                                        ↳ QDP

                                          ↳ UsableRulesProof

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot(vuz216, vuz217, vuz218, Succ(vuz2190), Succ(vuz2200)) → new_quot(vuz216, vuz217, vuz218, vuz2190, vuz2200)

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz13000), Succ(vuz1310)) → new_primMinusNatS2(vuz13000, vuz1310)
new_primMinusNatS2(Zero, Succ(vuz1310)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz13000), Zero) → Succ(vuz13000)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Succ(x0))

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                ↳ QDP

                                ↳ QDP

                                  ↳ QDPOrderProof

                                    ↳ QDP

                                      ↳ DependencyGraphProof

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot(vuz216, vuz217, vuz218, Succ(vuz2190), Succ(vuz2200)) → new_quot(vuz216, vuz217, vuz218, vuz2190, vuz2200)

R is empty.
The set Q consists of the following terms:

new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Succ(x0))

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Succ(x0))

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                ↳ QDP

                                ↳ QDP

                                  ↳ QDPOrderProof

                                    ↳ QDP

                                      ↳ DependencyGraphProof

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                                ↳ QDP

                                                  ↳ QDPSizeChangeProof

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot(vuz216, vuz217, vuz218, Succ(vuz2190), Succ(vuz2200)) → new_quot(vuz216, vuz217, vuz218, vuz2190, vuz2200)

From the DPs we obtained the following set of size-change graphs:

new_quot(vuz216, vuz217, vuz218, Succ(vuz2190), Succ(vuz2200)) → new_quot(vuz216, vuz217, vuz218, vuz2190, vuz2200)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 > 4, 5 > 5

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot6(vuz149, Succ(Succ(vuz16100)), Succ(vuz1510), vuz160) → new_quot7(vuz149, vuz16100, Succ(vuz1510), vuz16100, vuz1510)
new_quot6(vuz149, Succ(Zero), Zero, vuz160) → new_quot6(vuz149, new_primMinusNatS2(Zero, Zero), Zero, new_primMinusNatS2(Zero, Zero))
new_quot7(vuz202, vuz203, vuz204, Succ(vuz2050), Succ(vuz2060)) → new_quot7(vuz202, vuz203, vuz204, vuz2050, vuz2060)
new_quot6(vuz149, Succ(Succ(vuz16100)), Zero, vuz160) → new_quot6(vuz149, new_primMinusNatS2(Succ(vuz16100), Zero), Zero, new_primMinusNatS2(Succ(vuz16100), Zero))
new_quot8(vuz72, vuz730, vuz3100) → new_quot5(vuz72, vuz730, vuz3100)
new_quot4(vuz72, vuz730, vuz3100) → new_quot5(vuz72, vuz730, vuz3100)
new_quot7(vuz202, vuz203, vuz204, Zero, Succ(vuz2060)) → new_quot8(vuz202, vuz204, Succ(vuz203))
new_quot7(vuz202, vuz203, vuz204, Zero, Zero) → new_quot9(vuz202, vuz203, vuz204)
new_quot6(vuz149, Succ(Zero), Succ(vuz1510), vuz160) → new_quot8(vuz149, Succ(vuz1510), Zero)
new_quot9(vuz202, vuz203, vuz204) → new_quot6(vuz202, new_primMinusNatS2(Succ(vuz203), vuz204), vuz204, new_primMinusNatS2(Succ(vuz203), vuz204))
new_quot5(vuz72, vuz730, vuz3100) → new_quot5(vuz72, vuz730, vuz3100)
new_quot7(vuz202, vuz203, vuz204, Succ(vuz2050), Zero) → new_quot6(vuz202, new_primMinusNatS2(Succ(vuz203), vuz204), vuz204, new_primMinusNatS2(Succ(vuz203), vuz204))

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz13000), Succ(vuz1310)) → new_primMinusNatS2(vuz13000, vuz1310)
new_primMinusNatS2(Zero, Succ(vuz1310)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz13000), Zero) → Succ(vuz13000)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Succ(x0))

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 3 SCCs with 5 less nodes.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                  ↳ UsableRulesProof

                                ↳ QDP

                                ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot5(vuz72, vuz730, vuz3100) → new_quot5(vuz72, vuz730, vuz3100)

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz13000), Succ(vuz1310)) → new_primMinusNatS2(vuz13000, vuz1310)
new_primMinusNatS2(Zero, Succ(vuz1310)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz13000), Zero) → Succ(vuz13000)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Succ(x0))

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                  ↳ UsableRulesProof

                                    ↳ QDP

                                      ↳ QReductionProof

                                ↳ QDP

                                ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot5(vuz72, vuz730, vuz3100) → new_quot5(vuz72, vuz730, vuz3100)

R is empty.
The set Q consists of the following terms:

new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Succ(x0))

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Succ(x0))

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                  ↳ UsableRulesProof

                                    ↳ QDP

                                      ↳ QReductionProof

                                        ↳ QDP

                                          ↳ NonTerminationProof

                                ↳ QDP

                                ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot5(vuz72, vuz730, vuz3100) → new_quot5(vuz72, vuz730, vuz3100)

The TRS R consists of the following rules:none

s = new_quot5(vuz72, vuz730, vuz3100) evaluates to t =new_quot5(vuz72, vuz730, vuz3100)

Thus s starts an infinite chain as s semiunifies with t with the following substitutions:

Semiunifier: [ ]
Matcher: [ ]

Rewriting sequence

The DP semiunifies directly so there is only one rewrite step from new_quot5(vuz72, vuz730, vuz3100) to new_quot5(vuz72, vuz730, vuz3100).

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                ↳ QDP

                                  ↳ UsableRulesProof

                                ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot6(vuz149, Succ(Succ(vuz16100)), Zero, vuz160) → new_quot6(vuz149, new_primMinusNatS2(Succ(vuz16100), Zero), Zero, new_primMinusNatS2(Succ(vuz16100), Zero))

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz13000), Succ(vuz1310)) → new_primMinusNatS2(vuz13000, vuz1310)
new_primMinusNatS2(Zero, Succ(vuz1310)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz13000), Zero) → Succ(vuz13000)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Succ(x0))

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                ↳ QDP

                                  ↳ UsableRulesProof

                                    ↳ QDP

                                      ↳ RuleRemovalProof

                                ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot6(vuz149, Succ(Succ(vuz16100)), Zero, vuz160) → new_quot6(vuz149, new_primMinusNatS2(Succ(vuz16100), Zero), Zero, new_primMinusNatS2(Succ(vuz16100), Zero))

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz13000), Zero) → Succ(vuz13000)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Succ(x0))

new_quot6(vuz149, Succ(Succ(vuz16100)), Zero, vuz160) → new_quot6(vuz149, new_primMinusNatS2(Succ(vuz16100), Zero), Zero, new_primMinusNatS2(Succ(vuz16100), Zero))

Used ordering: POLO with Polynomial interpretation [25]:

POL(Succ(x₁)) = 1 + 2·x₁
POL(Zero) = 0
POL(new_primMinusNatS2(x₁, x₂)) = x₁ + 2·x₂
POL(new_quot6(x₁, x₂, x₃, x₄)) = x₁ + x₂ + x₃ + x₄

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                ↳ QDP

                                  ↳ UsableRulesProof

                                    ↳ QDP

                                      ↳ RuleRemovalProof

                                        ↳ QDP

                                          ↳ PisEmptyProof

                                ↳ QDP

                      ↳ Narrow

Q DP problem:
P is empty.
The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz13000), Zero) → Succ(vuz13000)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Succ(x0))

We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                ↳ QDP

                                ↳ QDP

                                  ↳ QDPOrderProof

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot7(vuz202, vuz203, vuz204, Succ(vuz2050), Succ(vuz2060)) → new_quot7(vuz202, vuz203, vuz204, vuz2050, vuz2060)
new_quot6(vuz149, Succ(Succ(vuz16100)), Succ(vuz1510), vuz160) → new_quot7(vuz149, vuz16100, Succ(vuz1510), vuz16100, vuz1510)
new_quot7(vuz202, vuz203, vuz204, Zero, Zero) → new_quot9(vuz202, vuz203, vuz204)
new_quot9(vuz202, vuz203, vuz204) → new_quot6(vuz202, new_primMinusNatS2(Succ(vuz203), vuz204), vuz204, new_primMinusNatS2(Succ(vuz203), vuz204))
new_quot7(vuz202, vuz203, vuz204, Succ(vuz2050), Zero) → new_quot6(vuz202, new_primMinusNatS2(Succ(vuz203), vuz204), vuz204, new_primMinusNatS2(Succ(vuz203), vuz204))

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz13000), Succ(vuz1310)) → new_primMinusNatS2(vuz13000, vuz1310)
new_primMinusNatS2(Zero, Succ(vuz1310)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz13000), Zero) → Succ(vuz13000)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Succ(x0))

We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

new_quot6(vuz149, Succ(Succ(vuz16100)), Succ(vuz1510), vuz160) → new_quot7(vuz149, vuz16100, Succ(vuz1510), vuz16100, vuz1510)

The remaining pairs can at least be oriented weakly.

new_quot7(vuz202, vuz203, vuz204, Succ(vuz2050), Succ(vuz2060)) → new_quot7(vuz202, vuz203, vuz204, vuz2050, vuz2060)
new_quot7(vuz202, vuz203, vuz204, Zero, Zero) → new_quot9(vuz202, vuz203, vuz204)
new_quot9(vuz202, vuz203, vuz204) → new_quot6(vuz202, new_primMinusNatS2(Succ(vuz203), vuz204), vuz204, new_primMinusNatS2(Succ(vuz203), vuz204))
new_quot7(vuz202, vuz203, vuz204, Succ(vuz2050), Zero) → new_quot6(vuz202, new_primMinusNatS2(Succ(vuz203), vuz204), vuz204, new_primMinusNatS2(Succ(vuz203), vuz204))

Used ordering: Polynomial interpretation [25]:

POL(Succ(x₁)) = 1 + x₁
POL(Zero) = 0
POL(new_primMinusNatS2(x₁, x₂)) = x₁
POL(new_quot6(x₁, x₂, x₃, x₄)) = x₂
POL(new_quot7(x₁, x₂, x₃, x₄, x₅)) = 1 + x₂
POL(new_quot9(x₁, x₂, x₃)) = 1 + x₂

The following usable rules [17] were oriented:

new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz13000), Zero) → Succ(vuz13000)
new_primMinusNatS2(Succ(vuz13000), Succ(vuz1310)) → new_primMinusNatS2(vuz13000, vuz1310)
new_primMinusNatS2(Zero, Succ(vuz1310)) → Zero

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                ↳ QDP

                                ↳ QDP

                                  ↳ QDPOrderProof

                                    ↳ QDP

                                      ↳ DependencyGraphProof

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot7(vuz202, vuz203, vuz204, Succ(vuz2050), Succ(vuz2060)) → new_quot7(vuz202, vuz203, vuz204, vuz2050, vuz2060)
new_quot7(vuz202, vuz203, vuz204, Zero, Zero) → new_quot9(vuz202, vuz203, vuz204)
new_quot9(vuz202, vuz203, vuz204) → new_quot6(vuz202, new_primMinusNatS2(Succ(vuz203), vuz204), vuz204, new_primMinusNatS2(Succ(vuz203), vuz204))
new_quot7(vuz202, vuz203, vuz204, Succ(vuz2050), Zero) → new_quot6(vuz202, new_primMinusNatS2(Succ(vuz203), vuz204), vuz204, new_primMinusNatS2(Succ(vuz203), vuz204))

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz13000), Succ(vuz1310)) → new_primMinusNatS2(vuz13000, vuz1310)
new_primMinusNatS2(Zero, Succ(vuz1310)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz13000), Zero) → Succ(vuz13000)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Succ(x0))

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 3 less nodes.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                ↳ QDP

                                ↳ QDP

                                  ↳ QDPOrderProof

                                    ↳ QDP

                                      ↳ DependencyGraphProof

                                        ↳ QDP

                                          ↳ UsableRulesProof

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot7(vuz202, vuz203, vuz204, Succ(vuz2050), Succ(vuz2060)) → new_quot7(vuz202, vuz203, vuz204, vuz2050, vuz2060)

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz13000), Succ(vuz1310)) → new_primMinusNatS2(vuz13000, vuz1310)
new_primMinusNatS2(Zero, Succ(vuz1310)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz13000), Zero) → Succ(vuz13000)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Succ(x0))

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                ↳ QDP

                                ↳ QDP

                                  ↳ QDPOrderProof

                                    ↳ QDP

                                      ↳ DependencyGraphProof

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot7(vuz202, vuz203, vuz204, Succ(vuz2050), Succ(vuz2060)) → new_quot7(vuz202, vuz203, vuz204, vuz2050, vuz2060)

R is empty.
The set Q consists of the following terms:

new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Succ(x0))

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS2(Zero, Succ(x0))

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                ↳ QDP

                                ↳ QDP

                                  ↳ QDPOrderProof

                                    ↳ QDP

                                      ↳ DependencyGraphProof

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                                ↳ QDP

                                                  ↳ QDPSizeChangeProof

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot7(vuz202, vuz203, vuz204, Succ(vuz2050), Succ(vuz2060)) → new_quot7(vuz202, vuz203, vuz204, vuz2050, vuz2060)

From the DPs we obtained the following set of size-change graphs:

new_quot7(vuz202, vuz203, vuz204, Succ(vuz2050), Succ(vuz2060)) → new_quot7(vuz202, vuz203, vuz204, vuz2050, vuz2060)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 > 4, 5 > 5

Haskell To QDPs

primDivNatS0	x y True	= Succ (primDivNatS (primMinusNatS x y) (Succ y))
primDivNatS0	x y False	= Zero

primModNatS0	x y True	= primModNatS (primMinusNatS x y) (Succ y)
primModNatS0	x y False	= Succ x

gcd2	True yz zu	= gcd1 (zu == 0) yz zu
gcd2	zy zz vuu	= gcd0 zz vuu

signumReal2	x True	= 0
signumReal2	x False	= signumReal1 x (x > 0)

signumReal1	x True	= 1
signumReal1	x False	= signumReal0 x otherwise

reduce2Reduce1	vux vuy x y True	= error []
reduce2Reduce1	vux vuy x y False	= reduce2Reduce0 vux vuy x y otherwise

gcd0Gcd'2	x xz	= gcd0Gcd'1 (xz == 0) x xz
gcd0Gcd'2	yx yy	= gcd0Gcd'0 yx yy